← Back to all news
arXiv AI By Shuxin Liu, Qing Liu, Yi Du, Ou Wu

One Distribution, Two Channels: Coverage-Calibrated KV Retention and Compensation

Read the original on arXiv AI →

The paper introduces CORE, a method that jointly calibrates coverage and redistributes evicted mass for key–value (KV) cache in long‑context decoding. CORE combines query utility and log‑determinant coverage into a lightweight indexer, using a single calibrated distribution to both retain complementary KV states and parameterize latent‑memory writes. Experiments on three backbones show CORE outperforms the RULER baseline by up to 3.78 points at 90% compression and demonstrates strong decoding efficiency on LongBench and repeated‑eviction tests.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Related stories

arXiv AI
Jul 8

DepthWeave-KV: Token-Adaptive Cross-Layer Residual Factorization for Long-Context KV Cache Compression

arXiv:2607. 06523v1 Announce Type: new Abstract: Long-context language model inference is increasingly limited by the memory bandwidth and capacity required to store key-value caches, yet existing compression methods often apply uniform budgets across layers or tokens and degrade retrieval when lexical cues and semantic states require different preservation.

By Anna Cordoba, Adam Puente Tercero, Nerea Angulo Hijo, Mar Linares Tercero, Julia Barrientos, Ainhoa Miranda, Jesus Olivera
llmsnlpefficiencybenchmarks
More like this →
arXiv Machine Learning
Oct 9

Read What Matters: Query-Adaptive Quantization for KV Caches

The paper introduces ReadKV, a query‑adaptive quantization method for KV caches that stores keys and values in progressive codes, allowing each decoding query to allocate different precision prefixes for keys and values. By optimizing a calibrated distortion objective under fixed budgets, ReadKV achieves near‑optimal allocation and demonstrates that query‑dependent access can outperform any query‑independent reader at the same read budget. Experiments on six base models show that reading only four bits on average from an eight‑bit cache increases perplexity by at most 0.66% while reducing logical reads and retained capacity compared to a 16‑bit cache, and it achieves lower latency than existing codecs on an NVIDIA A10G.

By Siddharth Bhandari, Lucas Gretta, Krishna Balasubramanian, Shiva Kasiviswanathan
nlpefficiency
More like this →