When to Evict, Not What to Keep: Draft-Guided Eviction for Training-Free KV-Cache Compression
cs.LG, cs.CL
Submitted: 2026-09-27
Updated: 2026-10-08
License: http://creativecommons.org/licenses/by/4.0/
The gist: Training-free KV-cache compression methods such as SnapKV, H2O, and PyramidKV evict tokens at the end of prefill, aiming to preserve the attention mass that future queries are expected to
Terminology
Abstract
Training-free KV-cache compression methods such as SnapKV, H2O, and PyramidKV evict tokens at the end of prefill, aiming to preserve the attention mass that future queries are expected to use-optimizing what to keep. We show that this objective fails in two distinct ways. (1) Compensation: restoring the evicted attention mass can recover the attention-level target without recovering task quality. (2) Selection: covering more of the true decode-query mass can hurt quality when the recovered mass is fragmented rather than concentrated in coherent spans. These failures share a common cause: eviction occurs before the queries that determine the answer trajectory exist. We propose Draft-Guided Eviction (DGE), which defers eviction until after drafting the first k=2 answer tokens using the full cache - just one decode step beyond prefill. Because the draft is generated from the answer's own prefix, no cache entries are discarded before this trajectory signal becomes available. The per-head cache budget remains unchanged, and DGE can be applied directly to SnapKV, PyramidKV, H2O, and StreamingLLM without modifying their eviction scores. Unlike extra-pass methods, DGE changes when eviction occurs rather than what cache entries are selected. Extensive experiments demonstrate that DGE outperforms prior methods at every evaluated budget on five of six instruct-tuned backbones, achieving 44.2 on LongBench, nearly matching FullKV at 44.3. The timing-only control DGE-W achieves the same score, demonstrating that the gain comes from when eviction occurs rather than what is selected - an effect we term trajectory anchoring.
Sources
- LookaheadKV: Fast and Accurate KV Cache Eviction by Glimpsing into the Future without Generation
- PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling
- The Llama 3 Herd of Models
- Ada-KV: Optimizing KV Cache Eviction by Adaptive Budget Allocation for Efficient LLM Inference
- CriticalKV: Optimizing KV Cache Eviction from an Output Perturbation Perspective
- Not All Heads Matter: A Head-Level KV Cache Compression Method with Integrated Retrieval and Reasoning
- Mistral 7B
- KVzip: Query-Agnostic KV Cache Compression with Context Reconstruction
- Qwen2.5 Technical Report
- D2O: Dynamic Discriminative Operations for Efficient Long-Context Inference of Large Language Models
- LOOK-M: Look-Once Optimization in KV Cache for Efficient Multimodal Long-Context Inference
- Lookahead Q-Cache: Achieving More Consistent KV Cache Eviction via Pseudo Query
- Model Tells You Where to Merge: Adaptive KV Cache Merging for LLMs on Long-Context Tasks
- ThinK: Thinner Key Cache by Query-Driven Pruning
- Rethinking KV Cache Eviction via a Unified Information-Theoretic Objective
- Long Context Compression with Activation Beacon
- When Does Value-Aware KV Eviction Help? A Fixed-Contract Diagnostic for Non-Monotone Cache Compression
- Fast KV Compaction via Attention Matching
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks