English

KVzap: Fast, Adaptive, and Faithful KV Cache Pruning

Machine Learning 2026-02-04 v2 Artificial Intelligence Computation and Language

Abstract

Growing context lengths in transformer-based language models have made the key-value (KV) cache a critical inference bottleneck. While many KV cache pruning methods have been proposed, they have not yet been adopted in major inference engines due to speed--accuracy trade-offs. We introduce KVzap, a fast, input-adaptive approximation of KVzip that works in both prefilling and decoding. On Qwen3-8B, Llama-3.1-8B-Instruct, and Qwen3-32B across long-context and reasoning tasks, KVzap achieves 22--4×4\times KV cache compression with negligible accuracy loss and achieves state-of-the-art performance on the KVpress leaderboard. Code and models are available at https://github.com/NVIDIA/kvpress.

Keywords

Cite

@article{arxiv.2601.07891,
  title  = {KVzap: Fast, Adaptive, and Faithful KV Cache Pruning},
  author = {Simon Jegou and Maximilian Jeblick},
  journal= {arXiv preprint arXiv:2601.07891},
  year   = {2026}
}
R2 v1 2026-07-01T09:01:26.211Z