RestoreKV: Recovering Full-Cache Behavior Under Aggressive Query-Agnostic KV Cache Eviction
Summary
RestoreKV introduces a learned restoration mechanism that complements query-agnostic KV cache eviction, recovering full-cache behavior under aggressive budgets by generating a compact context-conditioned restore cache via a single LoRA-adapted pass, improving performance on four long-context benchmarks.
View Cached Full Text
Cached at: 08/05/26, 05:46 PM
Paper page - RestoreKV: Recovering Full-Cache Behavior Under Aggressive Query-Agnostic KV Cache Eviction
Source: https://huggingface.co/papers/2608.01247
Abstract
Query-agnosticKVcacheevictioncompressesacontextonceandreusestheresultingcacheforarbitraryfuturequeries,butperformancecancollapseundertightbudgets.ExistingmethodsprimarilyimprovewhichoriginalKVpairsareretained.WeintroduceRestoreKV,whichcomplementsthisselection-basedformulationwithlearnedrestorationunderthesametotalKVbudget.Ourkeyinsightisthat,althoughtheinformationlostthroughevictioniscontext-specific,themechanismforgeneratingitscompactcomplementcanbesharedacrosscontexts.Aftercontextprefill,afewrestoretokensattendtothefullKVcacheinasingleLoRA-adaptedpass,generatingacompact,context-conditionedrestorecache.Thebaseimportancescorerandevictionruleremainunchanged,andtheadaptersaredisabledforallsubsequentqueriesanddecoding.RestoreKVistrainedthroughparameter-efficientself-distillationfromthefrozenfull-cachemodel,optimizingonly0.4%oftheparametersandrequiringnotask-specifictuning.Acrossfourbackbonesandfourlong-contextbenchmarks,RestoreKVsubstantiallyreducescompression-induceddegradation.OnQwen3-4B,itimproves59of60paired,budget-matchedsettingsacrossfivebaseevictionmethods;ata5%budget,itraisesKVzipfrom38.2to73.2onRULER-4K.AppliedtoKVzip+,RestoreKVreaches86.4RULERaccuracyat16timescompressionontheKVPressBenchmark,whileaddinglessthan0.5%one-timecache-constructionoverheadina32K-contextevaluation.Ourprojectpageisavailableathttps://paper.pnu-cvsp.com/RestoreKV/
View arXiv pageView PDFProject pageAdd to collection
Get this paper in your agent:
hf papers read 2608\.01247
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper1
#### higokri/RestoreKV Text Generation• Updated1 day ago • 1
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2608.01247 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2608.01247 in a Space README.md to link it from this page.
Collections including this paper1
Similar Articles
ResKV: Reconstructing Omitted Attention Contributions for Fixed-Budget KV Cache Compression
ResKV proposes a KV cache compression method that divides a fixed budget into an exact main cache and a compact residual cache to reconstruct omitted attention contributions, improving performance on LongBench and RULER across multiple backbones.
ReST-KV: Robust KV Cache Eviction with Layer-wise Output Reconstruction and Spatial-Temporal Smoothing
This paper introduces ReST-KV, a novel method for robust KV cache eviction in large language models that uses layer-wise output reconstruction and spatial-temporal smoothing to improve efficiency. The method significantly reduces decoding latency and outperforms state-of-the-art baselines on long-context benchmarks like LongBench and RULER.
CompressKV: Semantic-Retrieval-Guided KV-Cache Compression for Resource-Efficient Long-Context LLM Inference
CompressKV proposes a semantic-retrieval-guided KV-cache compression method for GQA-based LLMs, identifying Semantic Retrieval Heads to retain critical tokens. It achieves over 97% full-cache performance using only 3% of the KV cache on LongBench tasks.
CONF-KV: Confidence-Aware KV Cache Eviction with Mixed-Precision Storage for Long-Horizon LLM
CONF-KV is a KV-cache management system that uses model uncertainty to dynamically adjust cache retention, improving memory efficiency for long-context LLM inference while maintaining accuracy within 1.5-2.1 perplexity points.
KVFetch: Temporal Prefetching for the Missing Half of KV Cache Compression
The paper introduces KVFetch, a training-free framework that adds a temporal recall channel to score-based KV cache compressors to fix "sequential forgetting" (verbatim copying breaking under compression), recovering copying performance from 0.8 to 78.4 and boosting the RULER-16K average by +8.4 at iso-budget.