EliteKV: Scalable KV Cache Compression via RoPE Frequency Selection and Joint Low-Rank Projection
On the map: Efficient LLM inference and serving → KV cache optimization
Abstract (arXiv)
Rotary Position Embedding (RoPE) enables each attention head to capture multi-frequency information along the sequence dimension and is widely applied in foundation models. However, the nonlinearity introduced by RoPE complicates optimization of the key state in the Key-Value (KV) cache for RoPE-based attention. Existing KV cache compression methods typically store key state before rotation and apply the transformation during decoding, introducing additional computational overhead. This paper introduces EliteKV, a flexible modification framework for RoPE-based models supporting variable KV cache compression ratios. EliteKV first identifies the intrinsic frequency preference of each head using RoPElite, selectively restoring linearity to certain dimensions of key within attention computation. Building on this, joint low-rank compression of key and value enables partial cache sharing. Experimental results show that with minimal uptraining on only 0.6% of the original training data, RoPE-based models achieve a 75% reduction in KV cache size while preserving performance within a negligible margin. Furthermore, EliteKV consistently performs well across models of different scales within the same family.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Placed in KV cache optimization, one of 12 directions in Efficient LLM inference and serving. First posted on arXiv 3 Mar 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2025: 1; 2026: 6.
7 papers.
- 2025Cartridges: Lightweight and general-purpose long context representations via self-studycited by 74
- 2026TriAttention: Efficient Long Reasoning with Trigonometric KV Compressioncited by 18
- 2026Addressable Memory for Video World Modelscited by 11
- 2026A Simple Plug-in for Improving Eviction-Based KV Cache Compressioncited by 3
- 2026WitCert: Sound Runtime Risk Observability and Gating for KV-Cache Quantizationcited by 3
- 2026RAP: KV-Cache Compression via RoPE-Aligned Pruningcited by 2
- 2026AttSVD:Prompt-Adaptive Low-Rank KV Cache Compression via Attention-Guided SVDcited by 0
- 2026AttSVD:Prompt-Adaptive Low-Rank KV Cache Compression via Attention-Guided SVD3 Oct 2026
- 2026Addressable Memory for Video World Models7 Aug 2026
- 2026WitCert: Sound Runtime Risk Observability and Gating for KV-Cache Quantization30 Jul 2026
- 2026A Simple Plug-in for Improving Eviction-Based KV Cache Compression22 May 2026
- 2026TriAttention: Efficient Long Reasoning with Trigonometric KV Compression6 Apr 2026
- 2026RAP: KV-Cache Compression via RoPE-Aligned Pruning1 Feb 2026
- 2025Cartridges: Lightweight and general-purpose long context representations via self-study6 Jun 2025
Similar, not cited
Close in wording, no citation either way
- 2024A Simple and Effective L2 Norm-Based Strategy for KV Cache Compression
- 2025SALS: Sparse Attention in Latent Space for KV cache Compression
- 2025SmallKV: Small Model Assisted Compensation of KV Cache Compression for Efficient LLM Inference
- 2024Eigen Attention: Attention in Low-Rank Space for KV Cache Compression
- 2026SlimKV: Joint Token-Feature KV Cache Compression with Reconstruction-Free Beacon Attention
- 2025HCAttention: Extreme KV Cache Compression via Heterogeneous Attention Computing for LLMs
- 2026A Self-Pruning Transformer: Extreme KV-Cache Compression with Universal Attention
- 2025AttentionPredictor: Temporal Patterns Matter for KV Cache Compression