X-EcoMLA: Upcycling Pre-Trained Attention into MLA for Efficient and Extreme KV Compression
On the map: Efficient LLM inference and serving → KV cache optimization
Abstract (arXiv)
Multi-head latent attention (MLA) is designed to optimize KV cache memory through low-rank key-value joint compression. Rather than caching keys and values separately, MLA stores their compressed latent representations, reducing memory overhead while maintaining the performance. While MLA improves memory efficiency without compromising language model accuracy, its major limitation lies in its integration during the pre-training phase, requiring models to be trained from scratch. This raises a key question: can we use MLA's benefits fully or partially in models that have already been pre-trained with different attention mechanisms? In this paper, we propose X-EcoMLA to deploy post training distillation to enable the upcycling of Transformer-based attention into an efficient hybrid MLA variant through lightweight post-training adaptation, bypassing the need for extensive pre-training. We demonstrate that leveraging the dark knowledge of a well-trained model can enhance training accuracy and enable extreme KV cache compression in MLA without compromising model performance. The experimental results show that our proposed method can effectively compress the KV cache while preserving the performance on the benchmarks; specifically, for Llama3.2-1B-Instruct baseline, a 6.4x compression achieves the same average score by using only 3.6B training tokens and 70 GPU hours on AMD MI300, whereas a 10.6x compression have less than 0.1% average score drop with 7B training tokens and 140 GPU hours. The code for this work is available at https://github.com/AMD-AGI/AMD-Hybrid-Models.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Placed in KV cache optimization, one of 12 directions in Efficient LLM inference and serving. Builds on 34 of its 40 references that are in the map. First posted on arXiv 14 Mar 2025.
Builds on
34 of 40 references.
Closest ancestors · 6
Same direction, newest first
- 2025Towards Economical Inference: Enabling DeepSeek's Multi-Head Latent Attention in Any Transformer-based LLMs20 Feb
- 2024Palu: Compressing KV-Cache with Low-Rank Projection30 Jul
- 2024Keep the Cost Down: A Review on Methods to Optimize LLM' s KV-Cache Consumption25 Jul
- 2024Model Tells You Where to Merge: Adaptive KV Cache Merging for LLMs on Long-Context Tasks11 Jul
- 2024GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM8 Mar
- 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models24 Jun
Other references · 28
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2020Longformer: The Long-Document Transformercited by 3,413
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
16 more
- 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,336
- 2019PubMedQA: A Dataset for Biomedical Research Question Answeringcited by 1,288
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,135
- 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 861
- 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 717
- 2022Sparse Upcycling: Training Mixture-of-Experts from Dense Checkpointscited by 209
- 2024Simple linear attention language models balance the recall-throughput tradeoffcited by 208
- 2024You Only Cache Once: Decoder-Decoder Architectures for Language Modelscited by 144
- 2024The Mamba in the Llama: Distilling and Accelerating Hybrid Modelscited by 122
- 2024The Hedgehog & the Porcupine: Expressive Linear Attentions with Softmax Mimicrycited by 120
- 2024PQCache: Product Quantization-based KVCache for Long Context LLM Inferencecited by 95
- 2024Transformers to SSMs: Distilling Quadratic Knowledge to Subquadratic Modelscited by 67
- 2024Mechanistic Design and Scaling of Hybrid Architecturescited by 59
- 2024Upcycling Large Language Models into Mixture of Expertscited by 49
- 2024GenQA: Generating Millions of Instructions from a Handful of Promptscited by 35
- 2023TransNormerLLM: A Faster and Better Large Language Model with Improved TransNormercited by 34
Built on by
Citing papers per year: 2025: 1; 2026: 3.
4 papers.
- 2025Zebra-Llama: Towards Extremely Efficient Hybrid Modelscited by 18
- 2026CARE: Covariance-Aware and Rank-Enhanced Decomposition for Enabling Multi-Head Latent Attentioncited by 5
- 2026EchoKV: Efficient KV Cache Compression via Similarity-Based Reconstructioncited by 4
- 2026Long-Context Aware Upcycling: A New Frontier for Hybrid LLM Scalingcited by 0
- 2026Long-Context Aware Upcycling: A New Frontier for Hybrid LLM Scaling27 Apr 2026
- 2026EchoKV: Efficient KV Cache Compression via Similarity-Based Reconstruction24 Mar 2026
- 2026CARE: Covariance-Aware and Rank-Enhanced Decomposition for Enabling Multi-Head Latent Attention18 Mar 2026
- 2025Zebra-Llama: Towards Extremely Efficient Hybrid Models22 May 2025
Similar, not cited
Close in wording, no citation either way
- 2025EG-MLA: Embedding-Gated Multi-head Latent Attention for Scalable and Efficient LLMs
- 2026MLAfication: Efficiently Enabling High-Fidelity MLA for Modern LLMs
- 2025Latent Multi-Head Attention for Small Language Models
- 2025HCAttention: Extreme KV Cache Compression via Heterogeneous Attention Computing for LLMs
- 2026Learning how to Forget: Fine-tuning for Long-Context Sparse Attention
- 2025AttentionPredictor: Temporal Patterns Matter for KV Cache Compression
- 2025KQ-SVD: Compressing the KV Cache with Provable Guarantees on Attention Fidelity
- 2025Expected Attention: KV Cache Compression by Estimating Attention from Future Queries Distribution