KV-cache compression
InfiniGen
InfiniGen: Efficient Generative Inference of Large Language Models with Dynamic KV Cache Management
Superseded — cited as a baseline and beaten by newer methods
6 papers critique it · 4 beat it on benchmarks
What papers say
Verbatim critique sentences, each from a paper that cites InfiniGen as a baseline.
AGX+InfiniGen and AGX+InfiniGenP are even slower than the FlexGen baseline due to fine-grained, token-level selection introducing significant preprocessing overhead.
“this approach incurs significant overhead due to the latency of fetching the selected sparse KV pairs from the CPU during decoding”
“However, the estimation time increases significantly as the sequence grows, and the inference time for a single layer is insufficient to cover this.”
“Prefetching approaches, including FlexGen and InfiniGen, help alleviate PCIe data transfer latency but face limitations in handling large-scale tasks or entail performance trade-offs.”
“Although this approach mitigates the GPU memory capacity constraint, it introduces a new I/O bottleneck. We observe that in InfiniGen, even with prefetching, slow I/O causes the GPU to stall for 61% of the end-to-end execution time, leading to a substantial performance degradation.”
“InfiniGen's recall latency cannot be fully hidden due to its inefficient token-wise recall.”
Beaten on benchmarks
Head-to-head results where a newer method reports beating InfiniGen. Values are copied from the source paper's tables — verify against the cited paper.
FreeKV beats InfiniGen
86.00 vs 46.00
pass@k · [DeepSeek-R1-Llama-8B, GPQA]
FreeKV: Boosting KV Cache Retrieval for Efficient LLM InferenceLiteCache + HATA beats InfiniGen
34.91 vs 161.09
decode latency · [Llama3-8B, seq=128K, bsz=1]
CLO: Efficient LLM Inference System with CPU-Light KVCache Offloading via Algorithm-System Co-DesignSys beats InfiniGen
83.57 vs 59.27
Avg (RULER) · [Llama-3.1-8B]
ShadowKV: KV Cache in Shadows for High-Throughput Long-Context LLM Inference
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