Feature learning as alignment: a structural property of gradient descent in non-linear neural networks
Not on the map. Why?
Abstract (arXiv)
Understanding the mechanisms through which neural networks extract statistics from input-label pairs through feature learning is one of the most important unsolved problems in supervised learning. Prior works demonstrated that the gram matrices of the weights (the neural feature matrices, NFM) and the average gradient outer products (AGOP) become correlated during training, in a statement known as the neural feature ansatz (NFA). Through the NFA, the authors introduce mapping with the AGOP as a general mechanism for neural feature learning. However, these works do not provide a theoretical explanation for this correlation or its origins. In this work, we further clarify the nature of this correlation, and explain its emergence. We show that this correlation is equivalent to alignment between the left singular structure of the weight matrices and the newly defined pre-activation tangent features at each layer. We further establish that the alignment is driven by the interaction of weight changes induced by SGD with the pre-activation features, and analyze the resulting dynamics analytically at early times in terms of simple statistics of the inputs and labels. We prove the derivative alignment occurs almost surely in specific high dimensional settings. Finally, we introduce a simple optimization rule motivated by our analysis of the centered correlation which dramatically increases the NFA correlations at any given layer and improves the quality of features learned.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 36 of its 60 references that are in the map. First posted on arXiv 7 Feb 2024.
Builds on
36 of 60 references.
References · 36
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2018On Lazy Training in Differentiable Programmingcited by 671
- 2019Large Batch Optimization for Deep Learning: Training BERT in 76 minutescited by 671
- 2017Large Batch Training of Convolutional Networkscited by 529
- 2020Kernel and Rich Regimes in Overparametrized Modelscited by 302
- 2022Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limitcited by 184
- 2020Feature Learning in Infinite-Width Neural Networkscited by 182
- 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
- 2019Linearized two-layers neural networks in high dimensioncited by 155
24 more
- 2020When Do Neural Networks Outperform Kernel Methods?cited by 150
- 2022The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networkscited by 141
- 2019A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Normcited by 105
- 2019On the Power and Limitations of Random Features for Understanding Neural Networkscited by 103
- 2020The Neural Tangent Kernel in High Dimensions: Triple Descent and a Multi-Scale Theory of Generalizationcited by 101
- 2019What Can ResNet Learn Efficiently, Going Beyond Kernels?cited by 91
- 2019Limitations of Lazy Training of Two-layers Neural Networkscited by 87
- 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 76
- 2021Classifying high-dimensional Gaussian mixtures: Where kernel methods fail and neural networks succeedcited by 67
- 2022Neural Networks Efficiently Learn Low-Dimensional Representations with SGDcited by 61
- 2023A Theory of Non-Linear Feature Learning with One Gradient Step in Two-Layer Neural Networkscited by 46
- 2022Spectrum of inner-product kernel matrices in the polynomial regime and multiple descent phenomenon in kernel ridge regressioncited by 42
- 2022Second-order regression models exhibit progressive sharpening to the edge of stabilitycited by 40
- 2020Knowledge Distillation in Wide Neural Networks: Risk Bound, Data Efficiency and Imperfect Teachercited by 33
- 2020Temperature check: theory and practice for training models with softmax-cross-entropy lossescited by 31
- 2023Catapults in SGD: spikes in the training loss and their impact on generalization through feature learningcited by 29
- 2015Layer-Specific Adaptive Learning Rates for Deep Networkscited by 19
- 2023Provable Guarantees for Nonlinear Feature Learning in Three-Layer Neural Networkscited by 18
- 2024Linear Recursive Feature Machines provably recover low-rank matricescited by 16
- 2023Mechanism of feature learning in convolutional neural networkscited by 15
- 2023Spectral alignment of stochastic gradient descent for high-dimensional classification taskscited by 13
- 2023The Feature Speed Formula: a flexible approach to scale hyper-parameters of deep neural networkscited by 11
- 2023ReLU Neural Networks with Linear Layers are Biased Towards Single- and Multi-Index Modelscited by 7
- 2023Efficient Estimation of the Central Mean Subspace via Smoothed Gradient Outer Productscited by 7
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 6.
9 papers.
- 2024Emergence in non-neural models: grokking modular arithmetic via average gradient outer productcited by 26
- 2025On the Complexity-Faithfulness Trade-off of Gradient-Based Explanationscited by 2
- 2026Weibull Weight-Scale Parameter Evolution under AdamW Training Dynamicscited by 2
- 2026Breaking Data Symmetry is Needed For Generalization in Feature Learning Kernelscited by 1
- 2025From Coefficients to Directions: Rethinking Model Merging with Directional Alignmentcited by 0
- 2026Why Geometric Continuity Emerges in Deep Neural Networks: Residual Connections and Rotational Symmetry Breakingcited by 0
- 2026The Model Shape Behind Scaling Laws: A Gradient Superposition Perspectivecited by 0
- 2026Dual-Manifold Geometry Guided Representation Learning: Adaptive Coupling between Kernel and Data Spacescited by 0
- 2026A Function-Space Approach to the Statistical Mechanics of Learning Dynamicscited by 0
- 2026A Function-Space Approach to the Statistical Mechanics of Learning Dynamics9 Sep 2026
- 2026Dual-Manifold Geometry Guided Representation Learning: Adaptive Coupling between Kernel and Data Spaces13 Aug 2026
- 2026Weibull Weight-Scale Parameter Evolution under AdamW Training Dynamics11 Jun 2026
- 2026The Model Shape Behind Scaling Laws: A Gradient Superposition Perspective27 May 2026
- 2026Why Geometric Continuity Emerges in Deep Neural Networks: Residual Connections and Rotational Symmetry Breaking6 May 2026
- 2026Breaking Data Symmetry is Needed For Generalization in Feature Learning Kernels31 Mar 2026
- 2025From Coefficients to Directions: Rethinking Model Merging with Directional Alignment29 Nov 2025
- 2025On the Complexity-Faithfulness Trade-off of Gradient-Based Explanations14 Aug 2025
- 2024Emergence in non-neural models: grokking modular arithmetic via average gradient outer product29 Jul 2024