KV-cache compression
CaM
Superseded — cited as a baseline and beaten by newer methods
6 papers critique it · 6 beat it on benchmarks
What papers say
Verbatim critique sentences, each from a paper that cites CaM as a baseline.
these single-modal optimizations exhibit limited efficacy in MLLMs due to cross-modal distribution shifts and attention pattern divergence, failing to preserve modality-specific information fidelity.
“In contrast, CaM zhang2024cam adaptively merges evicted value states into others but does not merge the corresponding keys.”
“most merging methods rely on local heuristics, they often funnel many evicted tokens into a small set of span-boundary tokens. These boundary tokens therefore become the main information carriers, overloading their representations and making them prone to over-merging: excessive aggregation can blur or even erase their original semantics, thereby degrading overall performance.”
“CaM merges the values of evicted tokens only probabilistically, with a non-negligible probability of discarding them and hence losing information.”
“a fundamental limitation of these approaches is their uniform treatment of keys and values during merging despite their distinct distributional characteristics.”
“Notably, both Quest and CaM report results only on LLaMA2, without comparisons to other eviction methods, limiting their relevance to current frontier models.”
Beaten on benchmarks
Head-to-head results where a newer method reports beating CaM. Values are copied from the source paper's tables — verify against the cited paper.
EMS(w.o. pos) beats CaM
31.94 vs 5.76
Avg. · [LongChat-7B-v1.5-32k, cache budget 256]
EMS: Adaptive Evict-then-Merge Strategy for Head-wise KV Cache Compression Based on Global-Local ImportanceKeepKV beats CaM
8.45 vs 4.29
SemantiCache beats CaM
0.031 vs 0.039
TPOT (s) · [Llama-3-8B, 32k context]
SemantiCache: Efficient KV Cache Compression via Semantic Chunking and Clustered MergingAsymKV beats CaM
43.95 vs 37.49
Average · [Llama3.1-8B-Instruct]
Homogeneous Keys, Heterogeneous Values: Exploiting Local KV Cache Asymmetry for Long-Context LLMsWeightedKV beats CaM
3.86 vs 4.53
Perplexity · [Cache Size = 256]
WeightedKV: Attention Scores Weighted Key-Value Cache Merging for Large Language ModelsMeta-Soft beats CaM
75.72 vs 68.20
Avg · [All context lengths]
Meta-Soft: Leveraging Composable Meta-Tokens for Context-Preserving KV Cache Compression
What to use instead
Recent methods in the same sub-problem, not yet superseded in the knowledge base — arXiv benchmark leaders, not vetted production recommendations.
- STaR-KVSTaR-KV: Spatio-Temporal Adaptive Re-weighting for KV Cache Compression in GUI Vision-Language ModelsJun 1, 2026
- May 29, 2026
- May 28, 2026
- May 26, 2026
- May 25, 2026
- CONF-KVCONF-KV: Confidence-Aware KV Cache Eviction with Mixed-Precision Storage for Long-Horizon LLMMay 24, 2026
- May 21, 2026
- May 12, 2026
- Global Retention-Based KV EvictionMake Each Token Count: Towards Improving Long-Context Performance with KV Cache EvictionMay 10, 2026
- ReST-KVReST-KV: Robust KV Cache Eviction with Layer-wise Output Reconstruction and Spatial-Temporal SmoothingMay 9, 2026
- May 8, 2026