Skip to main content

AbridgeKV: Compressing Long Reasoning into the KV Cache of Learned Pause Tokens

Jack Cai, Lijie Yang, Vasilis Kontonis, Dimitris Papailiopoulos, Shivam Garg

Compresses each completed block of generated reasoning into the key/value cache of learned pause tokens, then discards the block's original cache. Later tokens attend to the compact replacement.

First public: · Added to this list: October 18, 2026

Cite this paper

ArXiv preprint

arXiv:2610.20641 · Initial submission: 2026-10-07

BibTeX · CSL-JSON

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.

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.