Skip to content
Preprint

RestoreKV: Recovering Full-Cache Behavior Under Aggressive Query-Agnostic KV Cache Eviction

Aug 2026 · 0 citations · 31 references
Computer Science

TL;DR

RestoreKV is introduced, which complements this selection-based formulation with learned restoration with learned restoration under the same total KV budget, and substantially reduces compression-induced degradation.

Abstract

Query-agnostic KV cache eviction compresses a context once and reuses the resulting cache for arbitrary future queries, but performance can collapse under tight budgets. Existing methods primarily improve which original KV pairs are retained. We introduce RestoreKV, which complements this selection-based formulation with learned restoration under the same total KV budget. Our key insight is that, although the information lost through eviction is context-specific, the mechanism for generating its compact complement can be shared across contexts. After context prefill, a few restore tokens attend to the full KV cache in a single LoRA-adapted pass, generating a compact, context-conditioned restore cache. The base importance scorer and eviction rule remain unchanged, and the adapters are disabled for all subsequent queries and decoding. RestoreKV is trained through parameter-efficient self-distillation from the frozen full-cache model, optimizing only $0.4\%$ of the parameters and requiring no task-specific tuning. Across four backbones and four long-context benchmarks, RestoreKV substantially reduces compression-induced degradation. On Qwen3-4B, it improves 59 of 60 paired, budget-matched settings across five base eviction methods; at a $5\%$ budget, it raises KVzip from $38.2$ to $73.2$ on RULER-4K. Applied to KVzip+, RestoreKV reaches $86.4$ RULER accuracy at $16\times$ compression on the KVPress Benchmark, while adding less than $0.5\%$ one-time cache-construction overhead in a 32K-context evaluation. Our project page is available at https://paper.pnu-cvsp.com/RestoreKV/

View source

Similar papers

Jul 2026

ResKV: Reconstructing Omitted Attention Contributions for Fixed-Budget KV Cache Compression

ResKV is proposed, which divides a fixed KV budget into an exact main cache and a compact residual cache that reconstructs the contribution of omitted tokens and lets main-cache tokens and residual entries participate in the same softmax normalization.

Yuhan Zhan, Lisi Chen, Shuo Shang · 2 citations
Preprint Jul 2026

LinearKV: One Cached State Suffices for Position-Independent Caching in Hybrid LLMs

LLM serving is increasingly accelerated by position-independent caching (PIC). Existing PIC methods, however, are built for full-attention models, where a token-indexed KV cache underlies its core operations: matching reusable token chunks, concatenating their KV entries, and selectively recomputing a few tokens to res...

Yi-Rui Liu, Ruoling Qi, Long-Wen Wang et al. · 1 citation

Plug-and-Play KV Cache Reuse for Low-Latency Retrieval-Augmented Generation

This work studies KV cache reuse for RAG under a strictly plug-and-play regime, where the base language model is left unchanged and no retraining, prompt redefinition, or selective recomputation is performed, and proposes a fine-tuning-free approach that reuses KV states across queries through an anchor-block and posit...

Ye Yue, Zhe-Wei Wang, Fabio Agosto et al. · 0 citations
#artificial intelligence Review Jul 2026

Error Certificates for KV-Cache Eviction via Randomized Design

It is proved that no estimator computable from the information a deterministic scheme retains is consistent for its own eviction error: evicted values can be altered so that everything retained is unchanged while the true attention-output error grows without bound.

Peng Xie · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.