mlsanityData to 7 Oct 2026

EliteKV: Scalable KV Cache Compression via RoPE Frequency Selection and Joint Low-Rank Projection

arXiv 2503.01586 ↗First posted 3 Mar 2025cs.LG cs.AI cs.CLcited by 7

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

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 6.

7 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024A Simple and Effective L2 Norm-Based Strategy for KV Cache Compression
  2. 2025SALS: Sparse Attention in Latent Space for KV cache Compression
  3. 2025SmallKV: Small Model Assisted Compensation of KV Cache Compression for Efficient LLM Inference
  4. 2024Eigen Attention: Attention in Low-Rank Space for KV Cache Compression
  5. 2026SlimKV: Joint Token-Feature KV Cache Compression with Reconstruction-Free Beacon Attention
  6. 2025HCAttention: Extreme KV Cache Compression via Heterogeneous Attention Computing for LLMs
  7. 2026A Self-Pruning Transformer: Extreme KV-Cache Compression with Universal Attention
  8. 2025AttentionPredictor: Temporal Patterns Matter for KV Cache Compression