Sign inGet started
Paper · arXiv

LongFlow: Efficient KV Cache Compression for Reasoning Models

Recent reasoning models such as OpenAI-o1 and DeepSeek-R1 have shown strong performance on complex tasks including mathematical reasoning and code generation. However, this performance gain comes with substantially longer output sequences, leading to significantly increased deployment costs. In particular, long outputs require large KV caches, resulting in high memory consumption and severe bandwidth pressure during attention computation. Most existing KV cache optimization methods are designed for long-input, short-output scenarios and are ineffective for the long-output setting of reasoning models. Moreover, importance estimation in prior work is computationally expensive and becomes pr...

AuthorsYi Su, Zhenxu Tian, Dan Qiao et al.
Primary categorycs.LG
Published12 March 2026
Last updated at source25 April 2026
cs.LGcs.CL
Embed this entry
<iframe src="https://silytics.si/embed/item/72435cf2-b797-4c43-a691-68a0628fdd79" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.