Low-Rank Key Value Attention

James O'Neill, Robert Clancy, Mariia Matskevichus, Fergal Reid
1/16/2026
cs.LG

No confident code implementation found for this paper.

Abstract

The key-value (KV) cache is a primary memory bottleneck in Transformers. We propose Low-Rank Key-Value (LRKV) attention, which reduces KV cache memory by exploiting redundancy across attention heads, while being compute efficient. Each layer uses a shared full-rank KV projection augmented with low-rank, head-specific residuals, providing a continuous trade-off between complete sharing and full independence. After pretraining models of size 128M to 6.3B parameters, LRKV consistently achieves the lowest test loss among standard MHA, MQA/GQA, and MLA while using only 45-53\% of MHA's KV cache. LRKV reaches equivalent baseline quality 18-25\% faster (measured in training steps). After supervised midtraining, LRKV achieves the highest downstream task performance across ARC-Easy, ARC-Challenge, MMLU, GSM8K, and HumanEval benchmarks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{oneill2026lowrank,
  title  = {Low-Rank Key Value Attention},
  author = {James O'Neill and Robert Clancy and Mariia Matskevichus and Fergal Reid},
  year   = {2026},
  eprint = {2601.11471},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.11471v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.11471.svg)](https://codeofpaper.com/paper/2601.11471)

Discussion