In plain words: The layer that turns a model's internal features into scores for every word squeezes the learning signal into a much smaller space as it travels backward. This crushes 95–99% of the gradient, so even trivial patterns can fail to learn.
Abstract · Lost in Backpropagation: The LM Head is a Gradient Bottleneck
The last layer of neural language models (LMs) projects output features of dimension $D$ to logits in dimension $V$, the size of the vocabulary, where usually $D \ll V$. This mismatch is known to raise risks of limited expressivity in neural LMs, creating a so-called softmax bottleneck. We show the softmax bottleneck is not only an expressivity bottleneck but also an optimization bottleneck. Backpropagating $V$-dimensional gradients through a rank-$D$ linear layer induces unavoidable compression, which alters the training feedback provided to the vast majority of the parameters. We present a theoretical analysis of this phenomenon and measure empirically that 95-99% of the gradient norm is suppressed by the output layer, resulting in vastly suboptimal update directions. We conduct controlled pretraining experiments showing that the gradient bottleneck makes trivial patterns unlearnable, and drastically affects the training dynamics of LLMs. We argue that this inherent flaw contributes to training inefficiencies at scale independently of the model architecture, and raises the need for new LM head designs.
Nathan Godey, Yoav Artzi
arXiv:2603.10145 · cs.CL · submitted Mar 10, 2026 · updated Jul 10, 2026
abstract · pdf · html · To be presented at COLM'26