Overview

Key-value cache pruning studies how to shrink the attention states that language and multimodal models retain during generation, enabling longer contexts and more efficient serving. Methods score tokens using signals such as attention and recency, predicted future utility, task or reasoning-step relevance, and uncertainty; others allocate budgets across layers or regions, quantize entries, or combine pruning with specialized hardware. Work spans long-context retrieval and reasoning, multi-turn agents, GUI tasks, and video generation, with both training-free policies and learned pruning mechanisms. A central tension is that useful importance signals and cache budgets vary by task, while aggressive compression must also deliver real gains in latency and memory traffic—not just a smaller cache—without losing answer-critical evidence.

Latest papers

CardsList

36 papers7 papers in the last four weeks, up 133% on the four weeks before. 0.0% of all new papers.

  1. DepthKV: Layer-Dependent KV Cache Pruning for Long-Context LLM Inference

    Apr 27, 2026Zahra Dehghanighobadi, Asja FischerLLM PruningKV Caching

  2. CHESS: Context-aware Hierarchical Efficient Semantic Selection for Long-Context LLM Inference

    Feb 24, 2026Chao Fei, Guozhong Li, Chenxi Liu +1Long-Context Language Model InferenceLLM Inference Acceleration

  3. GUI-KV: Efficient GUI Agents via KV Cache with Spatio-Temporal Awareness

    Oct 1, 2025Kung-Hsiang Huang, Haoyi Qiu, Yutong Dai +2KV-Cache CompressionEfficient Inference

  4. ReFreeKV: Towards Threshold-Free KV Cache Compression

    Feb 24, 2025Xuanfan Ni, Liyan Xu, Chenyang Lyu +6KV CachingMemory-Efficient Optimization