Statistical Inference and Quality Measures of KV Cache Quantisations Inspired by TurboQuant
On the map: Efficient LLM inference and serving → KV cache quantization
Abstract (arXiv)
We analyse three KV cache quantization schemes under a fair bit budget: KV (scalar MSE baseline), KQV (WHT + MSE on K; WHT + MSE + QJL on V), and QKQV (WHT + MSE + QJL on both). Starting from the Beta distribution on the hypersphere, we trace how QJL on K inflates inner product variance by π/2, which softmax amplifies nonlinearly via Jensen's inequality, and we present statistical inference and information metrics to highlight practical differences. Three empirical findings emerge. (1)~At n=4 (the practically dominant budget), KQV wins on every measure -- KL divergence, geometric K error, and 6D distance -- across all distributions and ranks tested. (2)~The K--V asymmetry is unconditional: QKQV is consistently worse than KQV in KL divergence at every budget and distribution. (3)~A budget-dependent crossover exists: QKQV achieves better geometric K reconstruction at n ∈ 2,3,5, KQV at n ∈ 4,6, invariant to rank and tail weight -- an open rate-distortion problem. KL(pref | pquant), K-only by construction, bridges K direction error to routing corruption and output collapse. We present a sufficient condition when the Jensen mechanism amplifies superlinearly through the softmax. At n ∈ 2,3,5, QKQV wins geometrically because this assumption does not bind. At n=4, elevated K error and KL divergence for QKQV strongly suggest the Jensen mechanism is the operative cause of the crossover, providing a new perspective and explanation.
Key facts. Cited by 2 papers in the map (data through 13 Oct 2026). Placed in KV cache quantization, one of 12 directions in Efficient LLM inference and serving. Builds on 2 of its 11 references that are in the map. First posted on arXiv 27 Apr 2026.
Builds on
2 of 11 references.
Closest ancestors · 1
Same direction, newest first
Other references · 1
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2025NQKV: A KV Cache Quantization Scheme Based on Normal Distribution Characteristics
- 2026D-Quant: Driftable Entropy Coding for KV Cache Quantization
- 2024KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantization
- 2024KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cache
- 2026OScaR: The Occam's Razor for Extreme KV Cache Quantization in LLMs and Beyond
- 2026HeadQ: Model-Visible Distortion and Score-Space Correction for KV-Cache Quantization
- 2025Kitty: Accurate and Efficient 2-bit KV Cache Quantization with Dynamic Channel-wise Precision Boost
- 2025PatternKV: Flattening KV Representation Expands Quantization Headroom