Low-Dimensional Execution Manifolds in Transformer Learning Dynamics: Evidence from Modular Arithmetic Tasks
Not on the map. Why?
Abstract (arXiv)
We investigate the geometric structure of learning dynamics in overparameterized transformer models through carefully controlled modular arithmetic tasks. Our primary finding is that despite operating in high-dimensional parameter spaces (d=128), transformer training trajectories rapidly collapse onto low-dimensional execution manifolds of dimension 3--4. This dimensional collapse is robust across random seeds and moderate task difficulties, though the orientation of the manifold in parameter space varies between runs. We demonstrate that this geometric structure underlies several empirically observed phenomena: (1) sharp attention concentration emerges as saturation along routing coordinates within the execution manifold, (2) SGD commutators are preferentially aligned with the execution subspace (up to 10× random baseline) early in training, with >92% of non-commutativity confined to orthogonal staging directions and this alignment decreasing as training converges, and (3) sparse autoencoders capture auxiliary routing structure but fail to isolate execution itself, which remains distributed across the low-dimensional manifold. Our results suggest a unifying geometric framework for understanding transformer learning, where the vast majority of parameters serve to absorb optimization interference while core computation occurs in a dramatically reduced subspace. These findings have implications for interpretability, training curriculum design, and understanding the role of overparameterization in neural network learning.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 9 of its 12 references that are in the map. First posted on arXiv 11 Feb 2026.
Builds on
9 of 12 references.
References · 9
- 2017Attention Is All You Needcited by 59,932
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 784
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
- 2024Scaling and evaluating sparse autoencoderscited by 530
- 2019Emergent properties of the local geometry of neural loss landscapescited by 46
Built on by
Citing papers per year: 2026: 7.
7 papers.
- 2026Low-Dimensional and Transversely Curved Optimization Dynamics in Grokkingcited by 10
- 2026The Geometry of Multi-Task Grokking: Transverse Instability, Superposition, and Weight Decay Phase Structurecited by 8
- 2026Early-Warning Signals of Grokking via Loss-Landscape Geometrycited by 6
- 2026Spectral Edge Dynamics of Training Trajectories: Signal--Noise Geometry Across Scalescited by 5
- 2026The Geometric Price of Discrete Logic: Context-driven Manifold Dynamics of Number Representationscited by 1
- 2026The Lifecycle of the Spectral Edge: From Gradient Learning to Weight-Decay Compressioncited by 1
- 2026Global Low-Rank, Local Full-Rank: The Holographic Encoding of Learned Algorithmscited by 0
- 2026The Lifecycle of the Spectral Edge: From Gradient Learning to Weight-Decay Compression8 Apr 2026
- 2026The Geometric Price of Discrete Logic: Context-driven Manifold Dynamics of Number Representations24 Mar 2026
- 2026Spectral Edge Dynamics of Training Trajectories: Signal--Noise Geometry Across Scales14 Mar 2026
- 2026Global Low-Rank, Local Full-Rank: The Holographic Encoding of Learned Algorithms20 Feb 2026
- 2026The Geometry of Multi-Task Grokking: Transverse Instability, Superposition, and Weight Decay Phase Structure19 Feb 2026
- 2026Early-Warning Signals of Grokking via Loss-Landscape Geometry19 Feb 2026
- 2026Low-Dimensional and Transversely Curved Optimization Dynamics in Grokking18 Feb 2026