arXiv Computation and Language By Chiwun Yang, Xiaoyu Li

Beyond Sparse Weights: When Is Attention Compressible?

Read the original on arXiv Computation and Language →

The paper investigates when attention maps can be compressed beyond simple sparsity, arguing that large weights alone do not guarantee compressibility. It introduces metrics such as global score gaps and weighted sums of omitted values to determine token retention for a target mass, and presents a retrieval–aggregation model to predict the impact of truncation. Based on these insights, the authors propose CertKV, a training‑free compressor that allocates a tail‑summary slot per head and distributes remaining slots according to value dispersion, achieving strong performance across several benchmarks.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv Machine Learning
Aug 27

Trust the Mass: Forced Weights in KV-Cache Eviction

The paper investigates KV‑cache eviction strategies for sparse‑attention models, showing that selecting the largest attention weights is nearly optimal—closing only a median 2–5 % of the gap to full attention. It further demonstrates that differences in performance between eviction methods largely stem from memory usage, with the new training‑free ContourKV allocator outperforming state‑of‑the‑art methods in most pairwise comparisons while matching their byte‑efficiency.

By Jack Shi, Jerry Gu
arXiv Machine Learning
Oct 9

When to Evict, Not What to Keep: Draft-Guided Eviction for Training-Free KV-Cache Compression

The paper introduces Draft‑Guided Eviction (DGE), a training‑free KV‑cache compression technique that postpones token eviction until after drafting the first two answer tokens, thereby preserving the cache entries needed for the answer trajectory. Unlike prior methods that focus on optimizing what to keep, DGE changes the timing of eviction, allowing existing compression schemes such as SnapKV, H2O, and PyramidKV to be applied without altering their eviction scores. Experiments show DGE consistently outperforms previous approaches across multiple instruct‑tuned models, achieving near‑full‑cache performance on LongBench and demonstrating that the improvement stems from trajectory anchoring rather than changes in cache selection.

By Haeyong Kang, Chang D. Yoo
arXiv AI
Oct 15

ChampionKV: Head-Wise Adaptive Budget Allocation for KV Cache Compression

ChampionKV introduces an input‑adaptive, head‑wise budget allocator for KV cache compression, using the maximum aggregated observation‑window attention score as a lightweight proxy for attention concentration. It assigns larger budgets to heads with dispersed attention and smaller budgets to concentrated heads, and incorporates an abnormal‑head mask and floor‑budget mechanism to enhance robustness. When integrated with existing compressors like SnapKV and PyramidKV, ChampionKV consistently improves performance on LongBench and RULER, especially on Llama3.1‑70B‑Instruct under tight budgets, while maintaining competitive results on smaller models.

By Yuechuan Chen, Yanda Guo, Xiaoxi Liu, Weilin Ruan, Huanbo Xu, Ruyi Wang, Wei Zhu
arXiv AI
Jun 24

CompressKV: Semantic-Retrieval-Guided KV-Cache Compression for Resource-Efficient Long-Context LLM Inference

arXiv:2606. 24467v1 Announce Type: new Abstract: Long-context large language model (LLM) inference is increasingly constrained by the memory footprint and decoding cost of key-value (KV) caches, limiting sustainable deployment on resource-constrained hardware.

By Xiaolin Lin, Jingcun Wang, Olga Kondrateva, Yiyu Shi, Bing Li, Grace Li Zhang