Skip to content
AI News HubLIVE
Original source2 min read

LKV: End-to-End Learning of Head-wise Budgets and Token Selection for LLM KV Cache Eviction

Summary

LKV introduces an end-to-end differentiable optimization approach for KV cache compression, learning task-optimized global budgets and token importance without heuristic proxies. It achieves state-of-the-art performance on LongBench and RULER, with near-lossless results at 15% cache retention on LongBench.

SourcearXiv Machine LearningAuthor: Enshuai Zhou, Yifan Hao, Chao Wang, Rui Zhang, Di Huang, Jiaming Guo, Xing Hu, Zidong Du, Qi Guo, Yunji Chen
LKV: End-to-End Learning of Head-wise Budgets and Token Selection for LLM KV Cache Eviction
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[2605.06676] LKV: End-to-End Learning of Head-wise Budgets and Token Selection for LLM KV Cache Eviction

[Submitted on 22 Apr 2026]

Title:LKV: End-to-End Learning of Head-wise Budgets and Token Selection for LLM KV Cache Eviction

View a PDF of the paper titled LKV: End-to-End Learning of Head-wise Budgets and Token Selection for LLM KV Cache Eviction, by Enshuai Zhou and 9 other authors

View PDF HTML (experimental)

Abstract:Long-context inference in Large Language Models (LLMs) is bottlenecked by the linear growth of Key-Value (KV) cache memory. Existing KV cache compression paradigms are fundamentally limited by heuristics: heuristic budgeting relies on statistical priors rather than task objectives, causing resource misallocation, while heuristic selection relies on coupled query-key interactions or static inductive biases (e.g., attention sinks). To address this limitation, we introduce LKV (Learned KV Eviction), which formulates KV compression as an end-to-end differentiable optimization problem. LKV integrates LKV-H to learn task-optimized global budgets, and LKV-T to derive intrinsic KV importance without materializing attention matrices. This design bypasses heuristic proxies, strictly aligning compression with task objectives. Extensive evaluations demonstrate that LKV achieves state-of-the-art performance on both LongBench and RULER benchmarks at high compression rates. In particular, on LongBench, LKV achieves near-lossless performance with only 15\% KV cache retention. Crucially, our analysis identifies learned budgeting as the dominant driver of fidelity, demonstrating that data-driven allocation is essential to overcome the limitations of hand-crafted heuristics.

Subjects:

Machine Learning (cs.LG); Computation and Language (cs.CL)

Cite as: arXiv:2605.06676 [cs.LG]

(or arXiv:2605.06676v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2605.06676

arXiv-issued DOI via DataCite

Submission history

From: Enshuai Zhou [view email] [v1] Wed, 22 Apr 2026 06:35:23 UTC (227 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled LKV: End-to-End Learning of Head-wise Budgets and Token Selection for LLM KV Cache Eviction, by Enshuai Zhou and 9 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.LG

new | recent | 2026-05

Change to browse by:

cs cs.CL

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

InvestorsAdvanced

Key points

  • Formulates KV cache compression as an end-to-end differentiable optimization problem
  • Combines LKV-H for learned budgets and LKV-T for learned token importance
  • Achieves near-lossless performance with 15% cache retention on LongBench

Highlights and analysis are generated automatically and may contain errors. Check the original source.