Rehearse Everything, Remember Nothing: Attic-KV Rehearses What Will Be Read
Not on the map. Why?
Abstract (arXiv)
Many key-value (KV) caches are compressed before anyone knows what will be asked of them: a document cached for retrieval, a prompt prefix shared across requests, the memory of a long conversation. The prevailing approach scores KV entries by rehearsal: the model rereads the context and keeps the entries it attends to, assuming that the more completely a cache rehearses its context, the better it remembers it. We show that under tight budgets this assumption backfires: rehearse everything, remember nothing. At a 3% keep ratio, rereading the whole context keeps 31.5 of 96.5 points on RULER, and on LongBench's natural-text tasks it falls below methods that rehearse nothing at all. The cause is that a cache keeps what it rehearses: rereading spreads the budget across the whole context, so the answer's own entries survive at little more than chance. Like a student before an exam, a cache remembers more by testing itself than by rereading. Two principles follow: rehearse what will be read, and rehearse as much as there is. We instantiate them as Attic-KV (Attic for short), a training-free rehearsal in which the model quizzes itself with question-answer pairs that quote the context, alongside anchor tokens in a content-adaptive amount. Changing only the rehearsal lifts three hosts that score it in three different ways: Attic alone is the best training-free method in all eight settings we test on RULER and LongBench's natural-text tasks, and plugged into the gradient-based KVgrad and the trained RestoreKV+, it raises them by up to 17.1 and 28.1 points. Its advantage grows as the budget shrinks, reaching 41.9 points over full rereading at a 3% keep ratio, and it compresses faster than rereading the whole context.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 41 of its 53 references that are in the map. First posted on arXiv 8 Oct 2026.
Builds on
41 of 53 references.
References · 41
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2025Qwen3 Technical Reportcited by 8,195
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,378
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,270
- 2024SnapKV: LLM Knows What You are Looking for Before Generationcited by 848
- 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Modelscited by 805
- 2024PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funnelingcited by 420
- 2023Prompt Cache: Modular Attention Reuse for Low-Latency Inferencecited by 255
- 2019Document Expansion by Query Predictioncited by 225
- 2024CacheBlend: Fast Large Language Model Serving for RAG with Cached Knowledge Fusioncited by 211
- 2023LooGLE: Can Long-Context Language Models Understand Long Contexts?cited by 200
29 more
- 2024Mooncake: A KVCache-centric Disaggregated Architecture for LLM Servingcited by 193
- 2025LMCache: An Efficient KV Cache Layer for Enterprise-Scale LLM Inferencecited by 119
- 2024RAGCache: Efficient Knowledge Caching for Retrieval-Augmented Generationcited by 97
- 2025KVzip: Query-Agnostic KV Cache Compression with Context Reconstructioncited by 89
- 2025Cartridges: Lightweight and general-purpose long context representations via self-studycited by 74
- 2025Expected Attention: KV Cache Compression by Estimating Attention from Future Queries Distributioncited by 70
- 2024TurboRAG: Accelerating Retrieval-Augmented Generation with Precomputed KV Caches for Chunked Textcited by 60
- 2025ChunkKV: Semantic-Preserving KV Cache Compression for Efficient Long-Context LLM Inferencecited by 57
- 2025KeyDiff: Key Similarity-Based KV Cache Eviction for Long-Context LLM Inference in Resource-Constrained Environmentscited by 49
- 2026Fast KV Compaction via Attention Matchingcited by 28
- 2025Compactor: Calibrated Query-Agnostic KV Cache Compression with Approximate Leverage Scorescited by 16
- 2025Lookahead Q-Cache: Achieving More Consistent KV Cache Eviction via Pseudo Querycited by 15
- 2026KVzap: Fast, Adaptive, and Faithful KV Cache Pruningcited by 14
- 2026Fast KVzip: Efficient and Accurate LLM Inference with Gated KV Evictioncited by 14
- 2025Learning Facts at Scale with Active Readingcited by 11
- 2025Draft-based Approximate Inference for LLMscited by 6
- 2026Where Matters More Than What: Decoding-aligned KV Cache Compression via Position-aware Pseudo Queriescited by 4
- 2026Rethinking KV Cache Eviction via a Unified Information-Theoretic Objectivecited by 4
- 2025Adaptive KV-Cache Compression without Manually Setting Budgetcited by 3
- 2026RestoreKV: Recovering Full-Cache Behavior Under Aggressive Query-Agnostic KV Cache Evictioncited by 2
- 2026Back from the Future: Key-Value Cache Management by Counter-Causal Surprisecited by 1
- 2026TaskPress: Query-Agnostic KV Cache Compression via Task-Guided Pruningcited by 1
- 2026Cartridges++: KV Cache Compression without Off-Context Derailmentcited by 1
- 2026ARC-KV: Amortizing Anchor Search for Reconstruction-Based KV Cache Compactioncited by 1
- 2026PatchKV: Weight-Space Compensation of KV Cachecited by 1
- 2026EchoPress: Query-Agnostic KV Cache Pruning via Virtual Context Reconstructioncited by 1
- 2026KV2: A Self-Refining KV Cachecited by 1
- 2026Behavior-Preserving KV Cache Compressioncited by 1
- 2026Monte Carlo Estimation for KV Cache Evictioncited by 1
Built on by
Not cited yet.