English

KV-Distill: Nearly Lossless Learnable Context Compression for LLMs

Computation and Language 2025-03-14 v1 Artificial Intelligence

Abstract

Sequence-to-sequence tasks often benefit from long contexts, but the quadratic complexity of self-attention in standard Transformers renders this non-trivial. During generation, temporary representations -stored in the so-called KV cache-account for a large portion of GPU memory usage and scale linearly with context length. We introduce KV-Distill, a Transformer compression framework that distills long context KV caches into significantly shorter representations in a question-independent fashion. KV-Distill can be trained as a parameter-efficient adaptor for pretrained models, and enables the compression of arbitrary spans of a context while preserving pre-trained model capabilities. We treat a compressed-uncompressed cache as a student-teacher pairing and apply a KL-type divergence to match the generated outputs. KV-Distill outperforms other compression techniques in worst-case extractive tasks and approaches uncompressed performance in long context question answering and summarization, and it can be fine-tuned on domain-specific contexts to reduce lengths by up to 99% while preserving downstream performance. We demonstrate the generalizability of KV-Distill across various model sizes and architectures.

Keywords

Cite

@article{arxiv.2503.10337,
  title  = {KV-Distill: Nearly Lossless Learnable Context Compression for LLMs},
  author = {Vivek Chari and Guanghui Qin and Benjamin Van Durme},
  journal= {arXiv preprint arXiv:2503.10337},
  year   = {2025}
}
R2 v1 2026-06-28T22:19:00.957Z