Feature learning is decoupled from generalization in high capacity neural networks
Not on the map. Why?
Abstract (arXiv)
Neural networks outperform kernel methods, sometimes by orders of magnitude, e.g. on staircase functions. This advantage stems from the ability of neural networks to learn features, adapting their hidden representations to better capture the data. We introduce a concept we call feature quality to measure this performance improvement. We examine existing theories of feature learning and demonstrate empirically that they primarily assess the strength of feature learning, rather than the quality of the learned features themselves. Consequently, current theories of feature learning do not provide a sufficient foundation for developing theories of neural network generalization.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 62 of its 72 references that are in the map. First posted on arXiv 25 Jul 2025.
Builds on
62 of 72 references.
References · 62
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2016Wide Residual Networkscited by 3,057
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2019Similarity of Neural Network Representations Revisitedcited by 1,695
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2018On the Spectral Bias of Neural Networkscited by 1,321
- 2017A Closer Look at Memorization in Deep Networkscited by 936
- 2022Toy Models of Superpositioncited by 928
- 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 713
- 2018On Lazy Training in Differentiable Programmingcited by 671
- 2017Deep Neural Networks as Gaussian Processescited by 617
- 2020Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural Networkscited by 200
38 more
- 2020Spectral Bias and Task-Model Alignment Explain Generalization in Kernel Regression and Infinitely Wide Neural Networkscited by 166
- 2016Linear Algebraic Structure of Word Senses, with Applications to Polysemycited by 165
- 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
- 2020When Do Neural Networks Outperform Kernel Methods?cited by 150
- 2019Neural Tangents: Fast and Easy Infinite Neural Networks in Pythoncited by 149
- 2022The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networkscited by 141
- 2020Frequency Bias in Neural Networks for Input of Non-Uniform Densitycited by 140
- 2018Regularization Matters: Generalization and Optimization of Neural Nets v.s. their Induced Kernelcited by 131
- 2019On the Power and Limitations of Random Features for Understanding Neural Networkscited by 103
- 2022Neural Collapse: A Review on Modelling Principles and Generalizationcited by 95
- 2019What Can ResNet Learn Efficiently, Going Beyond Kernels?cited by 91
- 2022More Than a Toy: Random Matrix Models Predict How Real-World Neural Representations Generalizecited by 87
- 2020Learning Parities with Neural Networkscited by 77
- 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 76
- 2024Scaling Exponents Across Parameterizations and Optimizerscited by 71
- 2020Implicit Bias in Deep Linear Classification: Initialization Scale vs Training Accuracycited by 70
- 2021Classifying high-dimensional Gaussian mixtures: Where kernel methods fail and neural networks succeedcited by 67
- 2022Limitations of Neural Collapse for Understanding Generalization in Deep Learningcited by 63
- 2022Fast Finite Width Neural Tangent Kernelcited by 62
- 2022Neural Networks Efficiently Learn Low-Dimensional Representations with SGDcited by 61
- 2024How Feature Learning Can Improve Neural Scaling Lawscited by 55
- 2021Separation of Scales and a Thermodynamic Description of Feature Learning in Some CNNscited by 53
- 2021What can linearized neural networks actually say about generalization?cited by 49
- 2022A Theoretical Analysis on Feature Learning in Neural Networks: Emergence from Inputs and Advantage over Fixed Featurescited by 49
- 2024From Lazy to Rich: Exact Learning Dynamics in Deep Linear Networkscited by 46
- 2021Quantifying the Benefit of Using Differentiable Learning over Tangent Kernelscited by 41
- 2022Limitations of the NTK for Understanding Generalization in Deep Learningcited by 34
- 2024Mathematical Models of Computation in Superpositioncited by 34
- 2020Analyzing Finite Neural Networks: Can We Trust Neural Tangent Kernel Theory?cited by 33
- 2021A self consistent theory of Gaussian Processes captures feature learning effects in finite CNNscited by 33
- 2022Random Feature Amplification: Feature Learning and Generalization in Neural Networkscited by 33
- 2021How rotational invariance of common kernels prevents generalization in high dimensionscited by 32
- 2022Learning sparse features can lead to overfitting in neural networkscited by 23
- 2019Asymptotic learning curves of kernel methods: empirical data v.s. Teacher-Student paradigmcited by 20
- 2023Local Kernel Renormalization as a mechanism for feature learning in overparametrized Convolutional Neural Networkscited by 19
- 2020Backward Feature Correction: How Deep Learning Performs Deep (Hierarchical) Learningcited by 18
- 2020Learning Over-Parametrized Two-Layer ReLU Neural Networks beyond NTKcited by 18
- 2024Mixed Dynamics In Linear Networks: Unifying the Lazy and Active Regimescited by 18
50 most cited of 62 All 62 (JSON)
Built on by
Citing papers per year: 2025: 1.
1 paper.