Microsoft and Cornell Unveil Free Pause Tokens to Boost LLM Efficiency

Editorial illustration: Navy tiles and cream tiles bearing pause symbols travel along a diagonal conveyor through a translucent teal enclosure containing curved channels.

In brief

  • Free Pause Tokens training technique improves next-token prediction without slowing inference speed.
  • Parallel prediction stream shares weights with main model, then ignored at inference time.
  • Training overhead minimal at 1.09–1.14x standard pipelines; no infrastructure redesign required.

A lightweight approach to transformer efficiency

[Free Pause Tokens] creates a lightweight parallel prediction stream during training that shares weights with the main model through shared gated feedforward networks. The key innovation: this parallel stream gets essentially ignored during inference, so there's no runtime cost. The technique sidesteps problems that plagued earlier work.

[Previous research from 2023 and 2024] attempted to address transformer models' fixed computation constraints by inserting explicit pause tokens into the input sequence. Those approaches came with real downsides—longer context lengths, bigger key-value caches, and slower inference. Free Pause Tokens avoids all three by operating only at training time.

Performance gains with minimal overhead

On a 1 billion parameter model, the technique achieved approximately [2 to 3 centinats improvement] in next-token prediction. That performance boost comes without the infrastructure burden of earlier methods. [Training with Free Pause Tokens takes only about 1.09 to 1.14 times as long] as a standard optimized pipeline, making the computational cost modest.

The efficiency comes from three specific technical choices. The team uses a technique called two-pass splitting for FlashAttention compatibility, sets a prediction window of w=0, and employs shared gated feedforward networks. These design decisions keep training overhead low without compromising the performance gains.

The [paper was submitted to arXiv on September 3] and describes how the parallel prediction stream shares weights with a model's main state stream. For practitioners deploying large language models, the absence of additional context length requirements is significant—it means the method fits into existing systems without architectural overhaul.