Almost Free State Prediction Separation
Moves pause-token computation into a parallel, weight-shared prediction stream, providing additional internal compute without increasing generated sequence length or key/value-cache length.
First public:
Earlier title: Free Pause Tokens.
Cite this paper
ArXiv preprint
arXiv:2609.03807 · Initial submission: 2026-09-03
A published-version citation has not been verified for this entry. This does not mean the paper is unpublished.
Choose the version you used. The arXiv link may serve a revision; check the original paper for the exact result, assumptions and limitations you cite.
Explore this approach
Thinking tokens — Give a model extra tokens for computation, such as pauses, filler symbols, or learned planning tokens. These tokens need not spell out the solution.
Alternative generation methods — Change how intermediate steps are generated, revised, or searched—for example, by refining several steps in parallel. These are related approaches: some still produce written chains of thought.
Read or reuse this entry
Plain-text Markdown · JSON record · Find in the full list
Our summary and categories are a reading aid, not the authors’ abstract. Use the original paper for research claims. Suggest a correction.