Incremental Learning of Sparse Attention Patterns in Transformers
Not on the map. Why?
Abstract (arXiv)
This paper studies simple transformers trained on a high-order Markov chain, where the model must incorporate information from multiple past positions, each with different statistical importance. We show that transformers learn the task incrementally, with each stage corresponding to learning how to copy information from a subset of positions via a sparse attention pattern. Notably, the learning dynamics transition from a competitive phase, where all heads focus on the statistically most important positions, to a cooperative phase, where different heads specialize in different patterns. We model these dynamics with simplified differential equations and prove stage-wise convergence of the resulting system. Functionally, these stages correspond to a sequence of increasingly expressive misspecified models, with the full model class reached only at the end. Overall, we give a theoretical account of how structured attention patterns and head specialization emerge in stages without an explicit curriculum, with implications for generalization in sequential tasks.
Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). Builds on 57 of its 72 references that are in the map. First posted on arXiv 22 Feb 2026.
Builds on
57 of 72 references.
References · 57
- 2020Language Models are Few-Shot Learnerscited by 32,320
- 2022In-context Learning and Induction Headscited by 940
- 2022Transformers learn in-context by gradient descentcited by 720
- 2022What Can Transformers Learn In-Context? A Case Study of Simple Function Classescited by 706
- 2019Implicit Regularization in Deep Matrix Factorizationcited by 404
- 2023Trained Transformers Learn Linear Models In-Contextcited by 333
- 2023Transformers learn to implement preconditioned gradient descent for in-context learningcited by 276
- 2018A mathematical theory of semantic development in deep neural networkscited by 184
- 2023Birth of a Transformer: A Memory Viewpointcited by 156
- 2020Towards Resolving the Implicit Bias of Gradient Descent for Matrix Factorization: Greedy Low-Rank Learningcited by 149
- 2023SGD learning on neural networks: leap complexity and saddle-to-saddle dynamicscited by 142
- 2019Implicit Regularization of Discrete Gradient Dynamics in Linear Neural Networkscited by 122
38 more
- 2023Sudden Drops in the Loss: Syntax Acquisition, Phase Transitions, and Simplicity Bias in MLMscited by 121
- 2024The Evolution of Statistical Induction Heads: In-Context Learning Markov Chainscited by 116
- 2023The mechanistic basis of data dependence and abrupt learning in an in-context classification taskcited by 115
- 2024How Transformers Learn Causal Structure with Gradient Descentcited by 115
- 2023In-Context Convergence of Transformerscited by 114
- 2023Scan and Snap: Understanding Training Dynamics and Token Composition in 1-layer Transformercited by 101
- 2022Vision Transformers provably learn spatial structurecited by 93
- 2024In-Context Language Learning: Architectures and Algorithmscited by 88
- 2023How Do Transformers Learn Topic Structure: Towards a Mechanistic Understandingcited by 85
- 2021Saddle-to-Saddle Dynamics in Deep Linear Networks: Small Initialization Training, Symmetry, and Sparsitycited by 84
- 2022Gradient flow dynamics of shallow ReLU networks for square loss and orthogonal inputscited by 75
- 2024Training Dynamics of Multi-Head Softmax Attention for In-Context Learning: Emergence, Convergence, and Optimalitycited by 73
- 2019The Implicit Bias of Depth: How Incremental Learning Drives Generalizationcited by 64
- 2023Understanding In-Context Learning in Transformers and LLMs by Learning to Learn Discrete Functionscited by 62
- 2023Saddle-to-Saddle Dynamics in Diagonal Linear Networkscited by 56
- 2023Transformers learn through gradual rank increasecited by 52
- 2024Competition Dynamics Shape Algorithmic Phases of In-Context Learningcited by 52
- 2024Unveiling Induction Heads: Provable Training Dynamics and Feature Learning in Transformerscited by 47
- 2025Training Dynamics of In-Context Learning in Linear Attentioncited by 45
- 2021Implicit Regularization in Tensor Factorizationcited by 44
- 2023Understanding Incremental Learning of Gradient Descent: A Fine-grained Analysis of Matrix Sensingcited by 42
- 2024Attention with Markov: A Framework for Principled Analysis of Transformers via Markov Chainscited by 40
- 2021Approximating How Single Head Attention Learnscited by 38
- 2024Towards a theory of how the structure of language is acquired by deep neural networkscited by 38
- 2022Algorithmic Regularization in Model-free Overparametrized Asymmetric Matrix Factorizationcited by 34
- 2024Transformers Can Represent n-gram Language Modelscited by 32
- 2024A phase transition between positional and semantic learning in a solvable model of dot-product attentioncited by 30
- 2022Incremental Learning in Diagonal Linear Networkscited by 28
- 2025The emergence of sparse attention: impact of data distribution and benefits of repetitioncited by 25
- 2024Transformers Provably Learn Sparse Token Selection While Fully-Connected Nets Cannotcited by 21
- 2025Learning curves theory for hierarchically compositional data with power-law distributed featurescited by 17
- 2025Learning In-context n-grams with Transformers: Sub-n-grams Are Near-stationary Pointscited by 16
- 2024Attention layers provably solve single-location regressioncited by 15
- 2024On the Training Convergence of Transformers for In-Context Classification of Gaussian Mixturescited by 15
- 2025Saddle-to-Saddle Dynamics Explains A Simplicity Bias Across Neural Network Architecturescited by 14
- 2025Fundamental limits of learning in sequence multi-index models and deep attention networks: High-dimensional asymptotics and sharp thresholdscited by 12
- 2025Parameter Symmetry Potentially Unifies Deep Learning Theorycited by 12
- 2025Alternating Gradient Flows: A Theory of Feature Learning in Two-layer Neural Networkscited by 12
50 most cited of 57 All 57 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.