Skip to content
AI News HubLIVE
Original source2 min read

How Query Visibility Changes KV-Cache Compression Rankings: A Matched-Budget Audit

Summary

A matched-budget audit of six KV-cache compression methods reveals that query visibility significantly alters performance rankings. Under the query-agnostic protocol (compression before seeing questions), only KeyDiff consistently outperforms simple baselines, while popular methods like SnapKV can underperform naive strategies.

SourcearXiv Machine LearningAuthor: Daming Luo, Christy Liang, Junyu Xuan
How Query Visibility Changes KV-Cache Compression Rankings: A Matched-Budget Audit
Report an error

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

Correction instructions
Read article

[Submitted on 11 Jul 2026]

Title:How Query Visibility Changes KV-Cache Compression Rankings: A Matched-Budget Audit

View a PDF of the paper titled How Query Visibility Changes KV-Cache Compression Rankings: A Matched-Budget Audit, by Daming Luo and 2 other authors

View PDF HTML (experimental)

Abstract:KV-cache compression methods are predominantly evaluated with the query appended to the context before compression -- a query-aware protocol. Yet the economic case for a compressed KV cache is reuse: compress a document once, answer many future questions against it. In that deployment, compression must happen query-agnostic -- before any question is seen. We present a matched-budget audit of six published compression methods against three trivial baselines on three open 7-9B models (144,300 paired evaluations on RULER-8192; 40,800 on LongBench; 50,000-resample paired bootstrap throughout). Everything is held fixed -- model, compression ratio, instances, decoding -- except the scoring rule. Three findings. (1) Query visibility changes the rankings: under the agnostic protocol, of the five audited methods that share a common attention backend, only KeyDiff beats a best-of-3 trivial baseline consistently (31 of 36 cells), and the most widely deployed method, SnapKV, loses to "keep the start and the recent window" on average (-0.066). (2) The per-method drop between the two protocols is ordered consistently with how visible the question is to each method's scoring signal, legible in its source code: from Delta=+0.198 for SnapKV (the question sits inside its 64-token observation window) down to Delta=+0.011 for KeyDiff (its score contains no query term at all).

Comments: 12 pages, 5 figures

Subjects:

Machine Learning (cs.LG); Artificial Intelligence (cs.AI)

Cite as: arXiv:2607.11942 [cs.LG]

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

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

arXiv-issued DOI via DataCite

Submission history

From: Daming Luo [view email] [v1] Sat, 11 Jul 2026 09:30:35 UTC (63 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled How Query Visibility Changes KV-Cache Compression Rankings: A Matched-Budget Audit, by Daming Luo and 2 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.LG

new | recent | 2026-07

Change to browse by:

cs cs.AI

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

  • Query visibility changes KV-cache compression rankings
  • Only KeyDiff beats trivial baselines under query-agnostic protocol
  • SnapKV, a widely deployed method, loses to a simple 'keep start and recent window' baseline

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