English

Low-Rank Attention Residuals

Machine Learning 2026-06-19 v1 Computation and Language

Abstract

Attention Residuals replace the fixed residual sum with depthwise attention over previous sub-layer outputs in large language models (LLMs), but use each output as both a full-dimensional key and value. This couples routing with representation and makes depth-routing scores scale with the hidden width dd. We propose Low-Rank Attention Residuals (LR-AttnRes), which keep full-dimensional residual values while using rr-dimensional keys, with rdr \ll d, for routing. Projected LR-AttnRes emits learned low-rank keys from existing output projections, decoupling routing from residual content and achieving the best validation loss among the variants tested. Sliced LR-AttnRes uses the last rr dimensions of each value as the routing key, removing the auxiliary key-projection path and reducing residual-side FLOPs while still improving performance. Comprehensive sweeps show that depthwise routing can be effective with far fewer dimensions than the model width. We release code and models to facilitate future research.

Cite

@article{arxiv.2607.09694,
  title  = {Low-Rank Attention Residuals},
  author = {Jonathan Su},
  journal= {arXiv preprint arXiv:2607.09694},
  year   = {2026}
}