KV Admission: Learning What to Write for Efficient Long-Context LLM Inference

Yen-Chieh Huang, Pi-Cheng Hsiu, Rui Fang, Ming-syan Chen


Abstract
Long-context LLM inference is bottlenecked by the quadratic attention complexity and linear Key-Value (KV) cache growth. Prior approaches mitigate this via post-hoc selection or eviction but overlook the root inefficiency: *indiscriminate token admission*. In this paper, we formalize KV management as a causal system of three primitives: KV Admission, Selection, and Eviction. We instantiate KV Admission via Write-Gated KV (WG-KV), a lightweight mechanism that learns to predict token utility *before* cache entry. By filtering out redundant states early to maintain a compact global cache alongside a sliding local cache, WG-KV significantly reduces memory usage and accelerates both prefill and decode phases. Our results demonstrate that *learning what to write* is a principled and practical recipe for efficient long-context inference. Code is available at https://github.com/EMCLab-Sinica/WG-KV.
Anthology ID:
2026.emnlp-main.1063
Volume:
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Month:
October
Year:
2026
Address:
Budapest, Hungary
Editors:
Hung-Yi Lee, Sunipa Dev, Jessy Li, Desmond Elliott
Venue:
EMNLP
SIG:
SIGDAT
Publisher:
Association for Computational Linguistics
Note:
Pages:
24411–24439
Language:
URL:
https://aclanthology.org/2026.emnlp-main.1063/
DOI:
Bibkey:
Cite (ACL):
Yen-Chieh Huang, Pi-Cheng Hsiu, Rui Fang, and Ming-syan Chen. 2026. KV Admission: Learning What to Write for Efficient Long-Context LLM Inference. In Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing, pages 24411–24439, Budapest, Hungary. Association for Computational Linguistics.
Cite (Informal):
KV Admission: Learning What to Write for Efficient Long-Context LLM Inference (Huang et al., EMNLP 2026)
Copy Citation:
PDF:
https://aclanthology.org/2026.emnlp-main.1063.pdf