KV-Rescue: Recovering Reasoning Language Model KV Eviction Loss via Stepwise Interleaving
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
KV-cache eviction caps the memory cost of long reasoning traces but is inherently lossy because the model decodes from a partial view of its history. Under aggressive budgets, this not only lowers accuracy but can also cause runaway degeneration, where the model produces incoherent or repetitive tokens until reaching the length limit. We characterize much of this loss as an information gapf caused by missing context, rather than a capability gap caused by limited model capacity. An evicted 7B model and a full-context 1.5B model make complementary errors, and an oracle choice between their answers recovers 79% of the accuracy gap to the full-KV 7B model. Based on this observation, we propose KV-Rescue, a training-free inference framework that bridges the information gap introduced by KV eviction using a lightweight full-context helper. KV-Rescue interleaves reasoning steps from the two models into a shared trajectory. An online detector uses entropy and compressibility to terminate the generation of incoherent or repetitive base-model candidates early. Across five math benchmarks with Qwen2.5-Math 7B and 72B, KV-Rescue recovers an average of 87% of the accuracy lost to eviction at eviction budget B=64. A decode-cost analysis further shows that preventing runaway degeneration cuts base-model token generation by 43% on average.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 14 of its 27 references that are in the map. First posted on arXiv 16 Aug 2026.
Builds on
14 of 27 references.
Closest ancestors · 4
Same direction, newest first
- 2026Quantized Reasoning Models Think They Need to Think Longer, but They Do Not29 May
- 2025R-KV: Redundancy-aware KV Cache Compression for Reasoning Models30 May
- 2024Do NOT Think That Much for 2+3=? On the Overthinking of o1-Like LLMs30 Dec
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters6 Aug
Other references · 10
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2024Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvementcited by 1,090
- 2023Accelerating Large Language Model Decoding with Speculative Samplingcited by 1,006
- 2022Solving math word problems with process- and outcome-based feedbackcited by 901
- 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Modelscited by 832
- 2024KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cachecited by 637
- 2024KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantizationcited by 591
- 2025Process Reward Models That Thinkcited by 118
- 2024Model Tells You Where to Merge: Adaptive KV Cache Merging for LLMs on Long-Context Taskscited by 96
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2026ForesightKV: Optimizing KV Cache Eviction for Reasoning Models by Learning Long-Term Contribution
- 2025G-KV: Decoding-Time KV Cache Eviction with Global Attention
- 2026CASK: Core-Aware Selective KV Compression for Reasoning Traces
- 2025SkipKV: Selective Skipping of KV Generation and Storage for Efficient Inference with Large Reasoning Models
- 2026KARA: Efficient Reasoning LLM Serving via Sliding-Window KV Cache Compression
- 2026Does Accuracy Equal Evidence? Reasoning Faithfulness under KV Cache Compression
- 2025LazyEviction: Lagged KV Eviction with Attention Pattern Observation for Efficient Long Reasoning
- 2026Value-Aware Stochastic KV Cache Eviction for Reasoning Models