Statistical Advantage of Softmax Attention: Insights from Single-Location Regression
Not on the map. Why?
Abstract (arXiv)
Large language models rely on attention mechanisms with a softmax activation. Yet the dominance of softmax over alternatives (e.g., component-wise or linear) remains poorly understood, and many theoretical works have focused on the easier-to-analyze linearized attention. In this work, we address this gap through a principled study of the single-location regression task, where the output depends on a linear transformation of a single input token at a random location. Building on ideas from statistical physics, we develop an analysis of attention-based predictors in the high-dimensional limit, where generalization performance is captured by a small set of order parameters. At the population level, we show that softmax achieves the Bayes risk, whereas linear attention fundamentally falls short. We then examine other activation functions to identify which properties are necessary for optimal performance. Finally, we analyze the finite-sample regime: we provide an asymptotic characterization of the test error and show that, while softmax is no longer Bayes-optimal, it consistently outperforms linear attention. We discuss the connection with optimization by gradient-based algorithms.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 35 of its 44 references that are in the map. First posted on arXiv 26 Sep 2025.
Builds on
35 of 44 references.
References · 35
- 2017Attention Is All You Needcited by 60,361
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2020Rethinking Attention with Performerscited by 1,601
- 2020Linformer: Self-Attention with Linear Complexitycited by 1,474
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,346
- 2023RWKV: Reinventing RNNs for the Transformer Eracited by 827
- 2022Transformers learn in-context by gradient descentcited by 732
- 2014Neural Turing Machinescited by 644
- 2022Hungry Hungry Hippos: Towards Language Modeling with State Space Modelscited by 499
- 2023Hyena Hierarchy: Towards Larger Convolutional Language Modelscited by 393
- 2023Trained Transformers Learn Linear Models In-Contextcited by 337
- 2023Transformers as Statisticians: Provable In-Context Learning with In-Context Algorithm Selectioncited by 298
23 more
- 2023Transformers learn to implement preconditioned gradient descent for in-context learningcited by 279
- 2022cosFormer: Rethinking Softmax in Attentioncited by 213
- 2023Zoology: Measuring and Improving Recall in Efficient Language Modelscited by 204
- 2016Using Fast Weights to Attend to the Recent Pastcited by 170
- 2023One Step of Gradient Descent is Provably the Optimal In-Context Learner with One Layer of Linear Self-Attentioncited by 170
- 2020Online stochastic gradient descent on non-convex losses from high-dimensional inferencecited by 119
- 2024Asymptotic theory of in-context learning by linear attentioncited by 55
- 2020Generalization error in high-dimensional perceptrons: Approaching Bayes error with convex optimizationcited by 51
- 2021Stable, Fast and Accurate: Kernelized Attention with Relative Positional Encodingcited by 51
- 2025Training Dynamics of In-Context Learning in Linear Attentioncited by 46
- 2022The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statisticscited by 31
- 2024A phase transition between positional and semantic learning in a solvable model of dot-product attentioncited by 30
- 2016Mutual information for symmetric rank-one matrix estimation: A proof of the replica formulacited by 26
- 2024MetaLA: Unified Optimal Linear Approximation to Softmax Attention Mapcited by 21
- 2024Scaling Laws for Linear Complexity Language Modelscited by 19
- 2024Attention layers provably solve single-location regressioncited by 17
- 2024LLM In-Context Recall is Prompt Dependentcited by 15
- 2025Asymptotics of Non-Convex Generalized Linear Models in High-Dimensions: A proof of the replica formulacited by 14
- 2024High-dimensional learning of narrow neural networkscited by 12
- 2025Fundamental limits of learning in sequence multi-index models and deep attention networks: High-dimensional asymptotics and sharp thresholdscited by 12
- 2024Linear Transformers with Learnable Kernel Functions are Better In-Context Modelscited by 11
- 2025Asymptotics of SGD in Sequence-Single Index Models and Single-Layer Attention Networkscited by 9
- 2025Resona: Improving Context Copying in Linear Recurrence Models with Retrievalcited by 5
Built on by
Citing papers per year: 2025: 2; 2026: 5.
7 papers.
- 2025Softmax as Linear Attention in the Large-Prompt Regime: a Measure-based Perspectivecited by 3
- 2026High-Dimensional Theory of LoRA Fine-Tuning in a Solvable Attention Modelcited by 3
- 2025Sliced ReLU attention: Quasi-linear contextual expressivity via sortingcited by 2
- 2026Specialization of softmax attention heads: insights from the high-dimensional single-location modelcited by 2
- 2026How Does Attention Help? Insights from Random Matrices on Signal Recovery from Sequence Modelscited by 0
- 2026Attention-based PCAcited by 0
- 2026High-Dimensional Learning Dynamics of Attention-Indexed Modelscited by 0
- 2026High-Dimensional Learning Dynamics of Attention-Indexed Models3 Sep 2026
- 2026High-Dimensional Theory of LoRA Fine-Tuning in a Solvable Attention Model4 Jun 2026
- 2026Attention-based PCA18 May 2026
- 2026How Does Attention Help? Insights from Random Matrices on Signal Recovery from Sequence Models7 May 2026
- 2026Specialization of softmax attention heads: insights from the high-dimensional single-location model4 Mar 2026
- 2025Softmax as Linear Attention in the Large-Prompt Regime: a Measure-based Perspective12 Dec 2025
- 2025Sliced ReLU attention: Quasi-linear contextual expressivity via sorting12 Dec 2025