This work presents KVDiagnosis, a diagnostic dataset and benchmark with three contributions, a 25-method taxonomy that groups methods into five mechanism families and links them to eight verified implementations and their valid diagnostic measurements, and a common record format.
Abstract
KV-cache compression reduces long-context memory, but aggregate task scores reveal neither which correct executions fail nor why. We present KVDiagnosis, a diagnostic dataset and benchmark with three contributions. First, a 25-method taxonomy groups methods into five mechanism families and links them to eight verified implementations and their valid diagnostic measurements. Second, for every supported method setting, we evaluate all sources in each fixed split against a per-source FullCache control before selecting FullCache-correct/compressed-wrong (C-to-W) rows separately for each method-setting, so no compressor defines another's test set. Third, a common record format links paired outputs and run metadata to cache, likelihood, attention, and decoding measurements with explicit applicability states. On Qwen3-8B, four evidence-aware workloads yield 59 800 supported compressed runs over 2600 sources and 12 520 C-to-W rows. Under fixed diagnostic rules, 63.2% have low or partial measured/projected coverage. Only 19 rows (0.2%) combine high measured/projected coverage with strong likelihood drift; another 2,126 (17.0%) preserve structural position addressability, for which representation fidelity remains unknown, while showing the same drift. Against C-to-C success controls, all ten diagnostics separate failed from successful compression (stratified AUROC 0.684-0.871). Among 96 reproducible low-EAR failures, a controlled 4x evidence-attention boost repairs 29.2%, versus 6.3% under a count-matched sham intervention and 3.3% degradation on matched C-to-C controls. Code and data are available at https://github.com/ChosenQC/KVDiagnosis.
Across a wide range of latency and peak memory constraints, MetaKV consistently outperforms the best static configuration, improving constrained success rate (CSR), the fraction of prompts answered correctly while satisfying both constraints, by approximately 0.07 on average and up to 0.135.
Michael Wang, Keith Li, Roozbeh Bostandoost· 0 citations
Energy-aware LLM serving requires comparing configurations under realistic request shapes, yet exhaustive target-GPU profiling is costly and a cheap predictor can be dangerously confident outside its measured scope. We present TokenPowerSandbox, an evidence-gated workflow that combines an interpretable CPU-resident pro...
VarRate is presented, a training-free KV codec that assigns each token a variable low-rank budget by its query salience, keeping every token at a nonzero rank, and is the strongest matched-memory compressor.
Shahrzad Esmat, Dhawal Shah, Ali Jannesari· arXiv.org· 0 citations
Minima-KV, a retention-preserving hierarchy for mixed-format paged attention, is presented, a practical mixed-format path for compressing long-context state without evicting live-request KV pages.
S. Kozyrev, AI DavydMaiborodaMinima, Inc.· 0 citations
With a trace-driven, event-atomic simulator over three MoE models, a large offline-optimal gap substantially overstates the gains recovered by representative lightweight causal mechanisms.
HiKV is a novel algorithm-hardware co-design that exploits KV cache redundancy through hierarchical importance awareness and outperforms state-of-the-art importance-based methods by achieving an additional 1.87x reduction in external memory accesses.
Chao Fang, Jun Yin, Man Shi et al.· IEEE Transactions on Circuit...· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.