Feature Learning beyond the Lazy-Rich Dichotomy: Insights from Representational Geometry
Not on the map. Why?
Abstract (arXiv)
Integrating task-relevant information into neural representations is a fundamental ability of both biological and artificial intelligence systems. Recent theories have categorized learning into two regimes: the rich regime, where neural networks actively learn task-relevant features, and the lazy regime, where networks behave like random feature models. Yet this simple lazy-rich dichotomy overlooks a diverse underlying taxonomy of feature learning, shaped by differences in learning algorithms, network architectures, and data properties. To address this gap, we introduce an analysis framework to study feature learning via the geometry of neural representations. Rather than inspecting individual learned features, we characterize how task-relevant representational manifolds evolve throughout the learning process. We show, in both theoretical and empirical settings, that as networks learn features, task-relevant manifolds untangle, with changes in manifold geometry revealing distinct learning stages and strategies beyond the lazy-rich dichotomy. This framework provides novel insights into feature learning across neuroscience and machine learning, shedding light on structural inductive biases in neural circuits and the mechanisms underlying out-of-distribution generalization.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 50 of its 98 references that are in the map. First posted on arXiv 23 Mar 2025.
Builds on
50 of 98 references.
References · 50
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,733
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2017Axiomatic Attribution for Deep Networkscited by 3,384
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,371
- 2013Visualizing and Understanding Convolutional Networkscited by 2,290
- 2013Rich feature hierarchies for accurate object detection and semantic segmentationcited by 2,162
- 2019Similarity of Neural Network Representations Revisitedcited by 1,755
- 2016Understanding intermediate layers using linear classifier probescited by 1,353
38 more
- 2018On the Spectral Bias of Neural Networkscited by 1,341
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
- 2023Progress measures for grokking via mechanistic interpretabilitycited by 839
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
- 2018On Lazy Training in Differentiable Programmingcited by 675
- 2021Do Vision Transformers See Like Convolutional Neural Networks?cited by 675
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 672
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 659
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 574
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 566
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 413
- 2021Explaining Neural Scaling Lawscited by 363
- 2018Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layerscited by 340
- 2020Kernel and Rich Regimes in Overparametrized Modelscited by 306
- 2019Intrinsic dimension of data representations in deep neural networkscited by 282
- 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 230
- 2020Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural Networkscited by 200
- 2017What do Neural Machine Translation Models Learn about Morphology?cited by 166
- 2020Spectral Bias and Task-Model Alignment Explain Generalization in Kernel Regression and Infinitely Wide Neural Networkscited by 166
- 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
- 2022High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representationcited by 150
- 2023Grokking as the Transition from Lazy to Rich Training Dynamicscited by 108
- 2021On the geometry of generalization and memorization in deep neural networkscited by 73
- 2023How Two-Layer Neural Networks Learn, One (Giant) Step at a Timecited by 68
- 2017Classification and Geometry of General Perceptual Manifoldscited by 62
- 2021Neural population geometry: An approach for understanding biological and artificial neural networkscited by 52
- 2022A Theoretical Analysis on Feature Learning in Neural Networks: Emergence from Inputs and Advantage over Fixed Featurescited by 49
- 2023Learning Efficient Coding of Natural Images with Maximum Manifold Capacity Representationscited by 31
- 2019The generalization error of max-margin linear classifiers: Benign overfitting and high dimensional asymptotics in the overparametrized regimecited by 28
- 2022The Influence of Learning Rule on Representation Dynamics in Wide Neural Networkscited by 19
- 2025The Geometry of Prompting: Unveiling Distinct Mechanisms of Task Adaptation in Language Modelscited by 18
- 2022Investigating Power laws in Deep Representation Learningcited by 17
- 2015On Simplicity and Complexity in the Brave New World of Large-Scale Neurosciencecited by 15
- 2023How connectivity structure shapes rich and lazy learning in neural circuitscited by 15
- 2020Identifying Learning Rules From Neural Network Observablescited by 9
- 2022Linear Classification of Neural Manifolds with Correlated Variabilitycited by 9
- 2023Probing Biological and Artificial Neural Networks with Task-dependent Neural Manifoldscited by 4
Built on by
Citing papers per year: 2025: 2; 2026: 7.
9 papers.
- 2026The Weight Gram Matrix Captures Sequential Feature Linearization in Deep Networkscited by 5
- 2026Geometry of Reason: Spectral Signatures of Valid Mathematical Reasoningcited by 4
- 2025Fast Generalized Neural Tangent Kernel Statistics via Trace Estimationcited by 3
- 2026Geometry-aware similarity metrics for neural representations on Riemannian and statistical manifoldscited by 3
- 2026Explaining Grokking in Transformers through the Lens of Inductive Biascited by 2
- 2026Diagnosing Generalization Failures from Representational Geometry Markerscited by 2
- 2025Quantifying task-relevant representational similarity using decision variable correlationcited by 0
- 2026Hyperbolic Neural Population Geometry Benefits Computationcited by 0
- 2026Adversarial Concept Search: Predicting Compositional Errors From Feature Geometrycited by 0
- 2026Adversarial Concept Search: Predicting Compositional Errors From Feature Geometry11 Jun 2026
- 2026Hyperbolic Neural Population Geometry Benefits Computation8 Jun 2026
- 2026The Weight Gram Matrix Captures Sequential Feature Linearization in Deep Networks7 May 2026
- 2026Geometry-aware similarity metrics for neural representations on Riemannian and statistical manifolds30 Mar 2026
- 2026Diagnosing Generalization Failures from Representational Geometry Markers2 Mar 2026
- 2026Explaining Grokking in Transformers through the Lens of Inductive Bias6 Feb 2026
- 2026Geometry of Reason: Spectral Signatures of Valid Mathematical Reasoning2 Jan 2026
- 2025Fast Generalized Neural Tangent Kernel Statistics via Trace Estimation13 Nov 2025
- 2025Quantifying task-relevant representational similarity using decision variable correlation2 Jun 2025