RECORD
Squeezing the Cache, Preserving the Truth: Monotonic Equipotential Allocation with Geodesia-KV
Hardware Architecture · Submitted 19 Aug 2026
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim With proper separation of resident and read bits and causal evaluation, we show that Geodesia-KV significantly outperforms other approaches.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
Current assessment of KV-cache compression performance confuses resident bits with read bandwidth and is affected by the artifacts of chunked teacher-forcing. We present Geodesia-KV, a family of training-free KV cache policies based on monotonic block-wise precision allocation, exact rate-distortion residuals, and query-sparse reading, enabling proper hardware-ready compression. With proper separation of resident and read bits and causal evaluation, we show that Geodesia-KV significantly outperforms other approaches. Specifically, on WikiText-2 with 16k context, the 5-bit operating point of Geodesia-KV results in lower perplexity at lower bitrate than KIVI-4 on Qwen. In addition, our compressed-Quest version delivers improved perplexity and reduces resident (9.83 vs 16.25 bits/value) and read rates (1.95 vs 2.32 bits/value) over baseline sparse methods on PG-19. As Geodesia-KV is implemented as native GeodesiaKVCacheManager plug-in of vLLM, Geodesia-KV fully removes the need for dense cache residency via monotonic bit demotion. With the full consumer hardware evaluation, Geodesia-KV leads to 1M-token context generation on a single 16 GiB GPU with up to 71.7% peak VRAM savings on all leading architectures (Qwen, Llama, DeepSeek).
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Current assessment of KV-cache compression performance confuses resident bits with read bandwidth and is affected by the artifacts of chunked teacher-forcing. | background 0.62 | 0.12 | 0.04 | asserted 1.00 |
| s1 | We present Geodesia-KV, a family of training-free KV cache policies based on monotonic block-wise precision allocation, exact rate-distortion residuals, and query-sparse reading, enabling proper hardware-ready compression. | contribution 0.91 | 0.87 | 0.18 | asserted 1.00 |
| s2 | With proper separation of resident and read bits and causal evaluation, we show that Geodesia-KV significantly outperforms other approaches. | result 0.97 | 0.92 | 0.63 | asserted 1.00 |
| s3 | Specifically, on WikiText-2 with 16k context, the 5-bit operating point of Geodesia-KV results in lower perplexity at lower bitrate than KIVI-4 on Qwen. | result 1.00 | 0.93 | 0.15 | asserted 1.00 |
| s4 | In addition, our compressed-Quest version delivers improved perplexity and reduces resident (9.83 vs 16.25 bits/value) and read rates (1.95 vs 2.32 bits/value) over baseline sparse methods on PG-19. | result 1.00 | 0.95 | 0.11 | asserted 1.00 |
| s5 | As Geodesia-KV is implemented as native GeodesiaKVCacheManager plug-in of vLLM, Geodesia-KV fully removes the need for dense cache residency via monotonic bit demotion. | method 0.78 | 0.74 | 0.10 | asserted 1.00 |
| s6 | With the full consumer hardware evaluation, Geodesia-KV leads to 1M-token context generation on a single 16 GiB GPU with up to 71.7% peak VRAM savings on all leading architectures (Qwen, Llama, DeepSeek). | result 1.00 | 0.92 | 0.31 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
Current assessment of KV-cache compression performance confuses resident bits with read bandwidth and is affected by the artifacts of chunked teacher-forcing. We present Geodesia-KV, a family of training-free KV cache policies based on monotonic block-wise precision allocation, exact rate-distortion residuals, and query-sparse reading, enabling proper hardware-ready compression. With proper separation of resident and read bits and causal evaluation, we show that Geodesia-KV significantly outperforms other approaches. Specifically, on WikiText-2 with 16k context, the 5-bit operating point of Geodesia-KV results in lower perplexity at lower bitrate than KIVI-4 on Qwen. In addition, our compressed-Quest version delivers improved perplexity and reduces resident (9.83 vs 16.25 bits/value) and read rates (1.95 vs 2.32 bits/value) over baseline sparse methods on PG-19. As Geodesia-KV is implemented as native GeodesiaKVCacheManager plug-in of vLLM, Geodesia-KV fully removes the need for dense cache residency via monotonic bit demotion. With the full consumer hardware evaluation, Geodesia-KV leads to 1M-token context generation on a single 16 GiB GPU with up to 71.7% peak VRAM savings on all leading architectures (Qwen, Llama, DeepSeek).
Human review
How the literature uses it
What this paper does with the arXiv papers it cites
What it cites · 2 sentences without a confident label
Cites as background 5 papers
-
KVQuant [ref] and GEAR [ref] incorporate nonuniform datatypes, sparse corrections, or low-rank structure.
GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM · Related Work · 0.98
-
InfLLM [ref] , MInference [ref] , RetrievalAttention [ref] , and InfiniteHiP [ref] employ representative tokens, structured sparsity, approximate retrieval, or hierarchical pruning/offload.
RetrievalAttention: Accelerating Long-Context LLM Inference via Vector Retrieval · Related Work · 0.99
-
InfLLM [ref] , MInference [ref] , RetrievalAttention [ref] , and InfiniteHiP [ref] employ representative tokens, structured sparsity, approximate retrieval, or hierarchical pruning/offload.
InfiniteHiP: Extending Language Model Context Up to 3 Million Tokens on a Single GPU · Related Work · 0.99
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.