PyramidInfer: Pyramid KV Cache Compression for High-throughput LLM Inference
Open accessAbstract
Large Language Models (LLMs) have shown remarkable comprehension abilities but face challenges in GPU memory usage during inference, hindering their scalability for realtime applications like chatbots.To accelerate inference, we store computed keys and values (KV cache) in the GPU memory.Existing methods study the KV cache compression to reduce memory by pruning the pre-computed KV cache.However, they neglect the inter-layer dependency between layers and huge memory consumption in pre-computation.To explore these deficiencies, we find that the number of crucial keys and values that influence future generations decreases layer by layer and we can extract them by the consistency in attention weights.Based on the findings, we propose PyramidInfer, a method that compresses the KV cache by layer-wise retaining crucial context.PyramidInfer saves significant memory by computing fewer keys and values without sacrificing performance.Experimental results show PyramidInfer improves 2.2x throughput compared to Accelerate with over 54% GPU memory reduction in KV cache.Our code is available in https://github.com/mutonix/ pyramidinfer.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Previous studies have reported a progressive reduction in the number of important KV cache across layers, forming a pyramid-shaped distribution.
“previous studies such as (Cai et al., 2024; Yang et al., 2024) have reported a progressive reduction in the number of important KV cache across layers, forming a pyramidshaped distribution.”
From EvolKV: Evolutionary KV Cache Compression for LLM Inference (2025) · cites this paper as Yang et al., 2024
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cited by
Sorted by citations
HotPrefix: Hotness-Aware KV Cache Scheduling for Efficient Prefix Sharing in LLM Inference Systems
Li, Y., Gu, R., Huan, C., Wang, Z., Yao, R., Tian, C., & Chen, G. (2025) · Proceedings of the ACM on Management of Data · doi:10.1145/3749168 · Cited by 9 · see citing works
PolyKV: Shared Asymmetric TurboQuant-Compressed KV Memory for Multi-Agent LLMs
Patel, I., & Joshi, I. (2026) · Ishan Patel · doi:10.5281/zenodo.19686729
EvolKV: Evolutionary KV Cache Compression for LLM Inference
Yu, B., & Chai, Y. (2025) · Findings of the Association for Computational Linguistics: EMNLP 2025 · doi:10.18653/v1/2025.findings-emnlp.88
- Authors
- Yang, D., Han, X., Gao, Y., Hu, Y., Zhang, S., & Zhao, H.
- Affiliations
- Shanghai Jiao Tong University (CN)
- Xiaohongshu (Little Red Book) (China) (CN)
- South China University of Technology (CN)
- Venue
- Findings of the Association for Computational Linguistics ACL 2024
- Published
- 2024
- Pages
- 3258-3270
- OpenAlex
- W4402670433
- Cited by
- 52
- References
- 0
- Citations by year
- 2026: 27 · 2025: 24 · 2024: 1
- FWCI
- 12.57
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Findings of the Association for Computational Linguistics: ACL (Findings of ACL) (publishedVersion)
- arXiv (Cornell University) (submittedVersion, cc-by)
- arXiv (Cornell University) (cc-by)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
- Keywords
- KV cache compression, large language model inference, GPU memory reduction, attention weights, inference throughput
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review