Multi-matrix Factorization Attention
On the map: Efficient LLM inference and serving → KV cache optimization
Abstract (arXiv)
We propose novel attention architectures, Multi-matrix Factorization Attention (MFA) and MFA-Key-Reuse (MFA-KR). Existing variants for standard Multi-Head Attention (MHA), including SOTA methods like MLA, fail to maintain as strong performance under stringent Key-Value cache (KV cache) constraints. MFA enhances model capacity by efficiently scaling up both the number and dimension of attention heads through low-rank matrix factorization in the Query-Key (QK) circuit. Extending MFA, MFA-KR further reduces memory requirements by repurposing the key cache as value through value projection re-parameterization. MFA's design enables strong model capacity when working under tight KV cache budget, while MFA-KR is suitable for even harsher KV cache limits with minor performance trade-off. Notably, in our extensive and large-scale experiments, the proposed architecture outperforms MLA and performs comparably to MHA, while reducing KV cache usage by up to 56% and 93.7%, respectively.
Key facts. Cited by 5 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 26 Dec 2024.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2025: 3; 2026: 2.
5 papers.
- 2025Tensor Product Attention Is All You Needcited by 27
- 2025SAS: Simulated Attention Scorecited by 3
- 2025UHD Image Dehazing via anDehazeFormer with Atmospheric-aware KV Cachecited by 1
- 2026Low-Rank Key Value Attentioncited by 1
- 2026Multi-Head Low-Rank Attentioncited by 0
- 2026Multi-Head Low-Rank Attention2 Mar 2026
- 2026Low-Rank Key Value Attention16 Jan 2026
- 2025SAS: Simulated Attention Score10 Jul 2025
- 2025UHD Image Dehazing via anDehazeFormer with Atmospheric-aware KV Cache20 May 2025
- 2025Tensor Product Attention Is All You Need11 Jan 2025
Similar, not cited
Close in wording, no citation either way
- 2026Thin Keys, Full Values: Reducing KV Cache via Low-Dimensional Attention Selection
- 2024Eigen Attention: Attention in Low-Rank Space for KV Cache Compression
- 2025Compressed Convolutional Attention: Efficient Attention in a Compressed Latent Space
- 2024Reducing Transformer Key-Value Cache Size with Cross-Layer Attention
- 2025Progressive Sparse Attention: Algorithm and System Co-design for Efficient Attention in LLM Serving
- 2025X-EcoMLA: Upcycling Pre-Trained Attention into MLA for Efficient and Extreme KV Compression
- 2025Expected Attention: KV Cache Compression by Estimating Attention from Future Queries Distribution
- 2025Q-Filters: Leveraging QK Geometry for Efficient KV Cache Compression