mlsanityData to 14 Oct 2026

CARE: Covariance-Aware and Rank-Enhanced Decomposition for Enabling Multi-Head Latent Attention

arXiv 2603.17946 ↗First posted 18 Mar 2026cs.LG cs.AIcited by 5

On the map: Efficient LLM inference and serving → KV cache optimization

Abstract (arXiv)

Converting pretrained attention modules such as grouped-query attention (GQA) into multi-head latent attention (MLA) can improve expressivity without increasing KV-cache cost, making it attractive for efficient inference. However, many practical conversion baselines rely on weight-only low-rank approximations (e.g., SVD-style initializations) and uniform rank allocation. They focus on minimizing the difference between weight matrices rather than on how those weights affect input activations, ignore the covariance structure of activations, and enforce uniform rank across layers, causing activation drift and degraded attention fidelity. To address these issues, we propose CARE, a Covariance-Aware, Rank-Enhanced MLA conversion pipeline under a fixed KV width. CARE introduces three key steps: (i) activation-preserving factorization, which aligns the approximation with the actual input activations rather than just the weights; (ii) adjusted-rank allocation, which spreads a fixed KV budget across layers by giving more capacity to layers that need it most; and (iii) KV-parity mapping, which reparameterizes the converted K and V to fit the MLA format while keeping the KV-cache size unchanged. Our method outperforms a uniform-rank SVD baseline on Qwen3-4B/30B-A3B-Instruct-2507 and Llama-3.1-8B/70B-Instruct, reducing one-shot perplexity by up to 215x and improving mean accuracy by up to 1.70x at matched KV budgets. With a brief post-SVD healing fine-tune, we fully recover the original model's accuracy.

Key facts. Cited by 5 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 56 of its 73 references that are in the map. First posted on arXiv 18 Mar 2026.

Builds on

56 of 73 references.

Closest ancestors · 3

Same direction, newest first

  1. 2025X-EcoMLA: Upcycling Pre-Trained Attention into MLA for Efficient and Extreme KV Compression14 Mar
  2. 2025TransMLA: Multi-Head Latent Attention Is All You Need11 Feb
  3. 2023Efficient Memory Management for Large Language Model Serving with PagedAttention12 Sep

Other references · 53

  1. 2017Attention Is All You Needcited by 60,361
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  3. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  4. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  5. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  6. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
  7. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  8. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
  9. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  10. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  11. 2023Mistral 7Bcited by 3,164
  12. 2016Pointer Sentinel Mixture Modelscited by 3,096
38 more
  1. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  2. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
  3. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,181
  4. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  5. 2024Qwen2 Technical Reportcited by 2,120
  6. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
  7. 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,868
  8. 2020Linformer: Self-Attention with Linear Complexitycited by 1,474
  9. 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,386
  10. 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
  11. 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
  12. 2018Self-Attention with Relative Position Representationscited by 1,120
  13. 2021Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolationcited by 1,103
  14. 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 861
  15. 2023Extending Context Window of Large Language Models via Positional Interpolationcited by 740
  16. 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 717
  17. 2024KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cachecited by 637
  18. 2023YaRN: Efficient Context Window Extension of Large Language Modelscited by 601
  19. 2024KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantizationcited by 591
  20. 2021Nystr"omformer: A Nystr"om-Based Algorithm for Approximating Self-Attentioncited by 471
  21. 2019HAWQ: Hessian AWare Quantization of Neural Networks with Mixed-Precisioncited by 402
  22. 2024QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebookscited by 378
  23. 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
  24. 2023The Impact of Positional Encoding on Length Generalization in Transformerscited by 327
  25. 2024LongRoPE: Extending LLM Context Window Beyond 2 Million Tokenscited by 313
  26. 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 306
  27. 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 243
  28. 2022DyLoRA: Parameter Efficient Tuning of Pre-trained Models using Dynamic Search-Free Low-Rank Adaptationcited by 233
  29. 2013Predicting Parameters in Deep Learningcited by 224
  30. 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 169
  31. 2022A Length-Extrapolatable Transformercited by 127
  32. 2024The Mamba in the Llama: Distilling and Accelerating Hybrid Modelscited by 122
  33. 2025SVD-LLM V2: Optimizing Singular Value Truncation for Large Language Model Compressioncited by 67
  34. 2025Dobi-SVD: Differentiable SVD for LLM Compression and Some New Perspectivescited by 48
  35. 2024CorDA: Context-Oriented Decomposition Adaptation of Large Language Models for Task-Aware Parameter-Efficient Fine-tuningcited by 44
  36. 2025VeOmni: Scaling Any Modality Model Training with Model-Centric Distributed Recipe Zoocited by 20
  37. 2025Zebra-Llama: Towards Extremely Efficient Hybrid Modelscited by 18
  38. 2022Numerical Optimizations for Weighted Low-rank Estimation on Language Modelcited by 14

50 most cited of 53 All 53 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 5.

5 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Towards Economical Inference: Enabling DeepSeek's Multi-Head Latent Attention in Any Transformer-based LLMs
  2. 2025EG-MLA: Embedding-Gated Multi-head Latent Attention for Scalable and Efficient LLMs
  3. 2025GTA: Grouped-head latenT Attention
  4. 2025Compressed Convolutional Attention: Efficient Attention in a Compressed Latent Space
  5. 2026Through the Bottleneck: How Multi-head Latent Attention Separates Content from Position in Language Models
  6. 2025Optimizing Native Sparse Attention with Latent Attention and Local Global Alternating Strategies
  7. 2026Attention Editing: A Versatile Framework for Cross-Architecture Attention Conversion
  8. 2025TPLA: Tensor Parallel Latent Attention for Efficient Disaggregated Prefill and Decode Inference