KV-cache compression
InfLLM
InfLLM: Training-Free Long-Context Extrapolation for LLMs with an Efficient Context Memory
Superseded — cited as a baseline and beaten by newer methods
5 papers critique it · 4 beat it on benchmarks
What papers say
Verbatim critique sentences, each from a paper that cites InfLLM as a baseline.
However, due to its sub-optimal block-level selection, it results in lower performance on most tasks compared to TokenSelect, even though we set a larger token budget for InfLLM.
“They require careful hyperparameter tuning (e.g., chunk size in InfLLM~xiao2024infllm, or ANN index construction in RetrievalAttention~liu2024retrievalattention) and must retain the full KV cache as a candidate pool, limiting memory savings.”
“this increases latency because of the newly introduced retrieval overhead which was not present in legacy methods”
“Though the block-level space-continuity assumption improves efficiency, it does not align with real scenarios where relevant tokens are distributed discretely, leading to a significant drop in model quality.”
“Although CPU offloading mitigates GPU memory limitations, existing approaches~xiao2024infllm,zhang2024pqcache still require retrieving a substantial portion of tokens (around 20\%), introducing significant decoding latency overheads due to slow data transfer between CPU RAM and GPU RAM.”
Beaten on benchmarks
Head-to-head results where a newer method reports beating InfLLM. Values are copied from the source paper's tables — verify against the cited paper.
TokenSelect beats InfLLM
75.17 vs 29.82
DynSplit-KV beats InfLLM
42.64 vs 28.43
Avg. · [KV Usage Rate = 0.1]
DynSplit-KV: Dynamic Semantic Splitting for KVCache Compression in Efficient Long-Context LLM InferenceLouver (offloaded) beats InfLLM
38.9 vs 26.2
Avg F1 · [KV offloading, 15% budget, LongBench, Llama-3.1-8B-Instruct]
Sparse Attention as a Range Searching Problem: Towards an Inference-Efficient Index for KV Cache
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.
- May 28, 2026
- May 18, 2026
- LouverSparse Attention as a Range Searching Problem: Towards an Inference-Efficient Index for KV CacheMay 7, 2026
- Apr 12, 2026
- ScoutAttentionScoutAttention: Efficient KV Cache Offloading via Layer-Ahead CPU Pre-computation for LLM InferenceMar 28, 2026
- DynSplit-KVDynSplit-KV: Dynamic Semantic Splitting for KVCache Compression in Efficient Long-Context LLM InferenceFeb 3, 2026
- HeteroCacheHeteroCache: A Dynamic Retrieval Approach to Heterogeneous KV Cache Compression for Long-Context LLM InferenceJan 20, 2026
- Dec 11, 2025
- CLOCLO: Efficient LLM Inference System with CPU-Light KVCache Offloading via Algorithm-System Co-DesignNov 18, 2025
- Oct 13, 2025