mlsanityData to 7 Oct 2026

How Does Gradient Descent Learn Features -- A Local Analysis for Regularized Two-Layer Neural Networks

arXiv 2406.01766 ↗First posted 3 Jun 2024cs.LG stat.MLcited by 4

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 22 of its 28 references that are in the map. First posted on arXiv 3 Jun 2024.

Builds on

22 of 28 references.

References · 22

  1. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  2. 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 784
  3. 2018On Lazy Training in Differentiable Programmingcited by 671
  4. 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
  5. 2019On Exact Computation with an Infinitely Wide Neural Netcited by 572
  6. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 463
  7. 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 422
  8. 2022Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limitcited by 184
  9. 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
  10. 2022High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representationcited by 146
  11. 2022The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networkscited by 141
  12. 2020Online stochastic gradient descent on non-convex losses from high-dimensional inferencecited by 119
10 more
  1. 2022Learning Single-Index Models with Shallow Neural Networkscited by 92
  2. 2017Learning One-hidden-layer Neural Networks with Landscape Designcited by 79
  3. 2020Learning Parities with Neural Networkscited by 77
  4. 2021The staircase property: How hierarchical structure can guide deep learningcited by 62
  5. 2022Neural Networks Efficiently Learn Low-Dimensional Representations with SGDcited by 61
  6. 2020Superpolynomial Lower Bounds for Learning One-Layer Neural Networks using Gradient Descentcited by 57
  7. 2022A Theoretical Analysis on Feature Learning in Neural Networks: Emergence from Inputs and Advantage over Fixed Featurescited by 49
  8. 2021A Local Convergence Theory for Mildly Over-Parameterized Two-Layer Neural Networkcited by 47
  9. 2021Understanding Deflation Process in Over-parametrized Tensor Decompositioncited by 20
  10. 2023Beyond NTK with Vanilla Gradient Descent: A Mean-Field Analysis of Neural Networks with Polynomial Width, Samples, and Timecited by 20

Built on by

Cited by year

Citing papers per year: 2025: 4.

4 papers.