How does Gradient Descent Learn Features - A Local Analysis for Regularized Two-Layer Neural Networks
Mo Zhou, Rong Ge
Abstract
The ability of learning useful features is one of the major advantages of neural networks. Although recent works show that neural network can operate in a neural tangent kernel (NTK) regime that does not allow feature learning, many works also demonstrate the potential for neural networks to go beyond NTK regime and perform feature learning. Recently, a line of work highlighted the feature learning capabilities of the early stages of gradient-based training. In this paper we consider another mechanism for feature learning via gradient descent through a local convergence analysis. We show that once the loss is below a certain threshold, gradient descent with a carefully regularized objective will capture ground-truth directions. We further strengthen this local convergence analysis by incorporating early-stage feature learning analysis. Our results demonstrate that feature learning not only happens at the initial gradient steps, but can also occur towards the end of training.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3a0c3803-6d4e-4ea8-925a-746179be4c5eCited by top-tier papers4
- Emergence and scaling laws in SGD learning of shallow neural networksYunwei Ren, Eshaan Nichani, Denny Wu, Jason D. LeeNeurIPS 2025 · 33 citations
- Measure gradients, not activations! Enhancing neuronal activity in deep reinforcement learningJiashun Liu, Zihao Wu, Johan S. Obando-Ceron, Pablo Samuel Castro et al.NeurIPS 2025 · 15 citations
- How Gradient descent balances features: A dynamical analysis for two-layer neural networksZhenyu Zhu, Fanghui Liu, Volkan CevherICLR 2025
- A Derandomization Framework for Structure Discovery: Applications in Neural Networks and BeyondNikos Tsikouras, Yorgos Pantis, Ioannis Mitliagkas, Christos TzamosICLR 2026
Builds on17
- Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational LimitBoaz Barak, Benjamin L. Edelman, Surbhi Goel, Sham M. Kakade et al.NeurIPS 2022 · 220 citations
- High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the RepresentationJimmy Ba, Murat A. Erdogdu, Taiji Suzuki, Zhichao Wang et al.NeurIPS 2022 · 173 citations
- Beyond Linearization: On Quadratic and Higher-Order Approximation of Wide Neural NetworksYu Bai, Jason D. LeeICLR 2020 · 128 citations
- Learning single-index models with shallow neural networksAlberto Bietti, Joan Bruna, Clayton Sanford, Min Jae SongNeurIPS 2022 · 119 citations
- How Transformers Learn Causal Structure with Gradient DescentEshaan Nichani, Alex Damian, Jason D. LeeICML 2024 · 117 citations
Related papers
- On feature learning in neural networks with global convergence guaranteesZhengdao Chen, Eric Vanden-Eijnden, Joan BrunaICLR 2022 · 15 citations
- A Generalized Neural Tangent Kernel Analysis for Two-layer Neural NetworksZixiang Chen, Yuan Cao, Quanquan Gu, Tong ZhangNeurIPS 2020 · 82 citations
- Grokking as the transition from lazy to rich training dynamicsTanishq Kumar, Blake Bordelon, Samuel J. Gershman, Cengiz PehlevanICLR 2024 · 86 citations
- Provable Guarantees for Neural Networks via Gradient Feature LearningZhenmei Shi, Junyi Wei, Yingyu LiangNeurIPS 2023 · 15 citations
- The Surprising Simplicity of the Early-Time Learning Dynamics of Neural NetworksWei Hu, Lechao Xiao, Ben Adlam, Jeffrey PenningtonNeurIPS 2020 · 77 citations
