Feature Learning beyond the Lazy-Rich Dichotomy: Insights from Representational Geometry
Chi-Ning Chou, Hang Le, Yichen Wang, SueYeon Chung
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers5
- Deep sequence models tend to memorize geometrically; it is unclear whyShahriar Noroozizadeh, Vaishnavh Nagarajan, Elan Rosenfeld, Sanjiv KumarICML 2026 · 11 citations
- Geometry of Reason: Spectral Signatures of Valid Mathematical ReasoningValentin NOËLICML 2026 · 4 citations
- Diagnosing Generalization Failures from Representational Geometry MarkersChi-Ning Chou, Artem Kirsanov, Yao-Yuan Yang, SueYeon ChungICLR 2026 · 2 citations
- Quantifying Task-relevant Similarities in Representations Using Decision Variable CorrelationsYu Qian, Wilson S. Geisler, Xue-Xin WeiNeurIPS 2025 · 1 citation
- Hyperbolic neural population geometry benefits computationDennis Wu, Yi-Chun Hung, Braden Yuille, James Fitzgerald et al.ICML 2026
Builds on16
- Do Vision Transformers See Like Convolutional Neural Networks?Maithra Raghu, Thomas Unterthiner, Simon Kornblith, Chiyuan Zhang et al.NeurIPS 2021 · 1,553 citations
- Deep Double Descent: Where Bigger Models and More Data HurtPreetum Nakkiran, Gal Kaplun, Yamini Bansal, Tristan Yang et al.ICLR 2020 · 1,108 citations
- Towards Understanding Grokking: An Effective Theory of Representation LearningZiming Liu, Ouail Kitouni, Niklas Nolte, Eric J. Michaud et al.NeurIPS 2022 · 299 citations
- Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural NetworksBlake Bordelon, Abdulkadir Canatar, Cengiz PehlevanICML 2020 · 245 citations
- Tensor Programs IV: Feature Learning in Infinite-Width Neural NetworksGreg Yang, Edward J. HuICML 2021 · 242 citations
Related papers
- When Representations Align: Universality in Representation Learning DynamicsLoek van Rossem, Andrew M. SaxeICML 2024 · 8 citations
- From Lazy to Rich: Exact Learning Dynamics in Deep Linear NetworksClémentine Carla Juliette Dominé, Nicolas Anguita, Alexandra Maria Proca, Lukas Braun et al.ICLR 2025
- Learning sparse features can lead to overfitting in neural networksLeonardo Petrini, Francesco Cagnetta, Eric Vanden-Eijnden, Matthieu WyartNeurIPS 2022 · 47 citations
- Neural Networks as Kernel Learners: The Silent Alignment EffectAlexander B. Atanasov, Blake Bordelon, Cengiz PehlevanICLR 2022 · 110 citations
- Hardness of Learning Neural Networks under the Manifold HypothesisBobak T. Kiani, Jason Wang, Melanie WeberNeurIPS 2024 · 25 citations
