The Quenching-Activation Behavior of the Gradient Descent Dynamics for Two-layer Neural Network Models
Not on the map. Why?
Abstract (arXiv)
A numerical and phenomenological study of the gradient descent (GD) algorithm for training two-layer neural network models is carried out for different parameter regimes when the target function can be accurately approximated by a relatively small number of neurons. It is found that for Xavier-like initialization, there are two distinctive phases in the dynamic behavior of GD in the under-parametrized regime: An early phase in which the GD dynamics follows closely that of the corresponding random feature model and the neurons are effectively quenched, followed by a late phase in which the neurons are divided into two groups: a group of a few "activated" neurons that dominate the dynamics and a group of background (or "quenched") neurons that support the continued activation and deactivation process. This neural network-like behavior is continued into the mildly over-parametrized regime, where it undergoes a transition to a random feature-like behavior. The quenching-activation process seems to provide a clear mechanism for "implicit regularization". This is qualitatively different from the dynamics associated with the "mean-field" scaling where all neurons participate equally and there does not appear to be qualitative changes when the network parameters are changed.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Jun 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 2; 2023: 1; 2024: 1.
7 papers.
- 2023The Implicit Regularization of Dynamical Stability in Stochastic Gradient Descentcited by 44
- 2022Why neural networks find simple solutions: the many regularizers of geometric complexitycited by 38
- 2021Embedding Principle of Loss Landscape of Deep Neural Networkscited by 36
- 2021Analysis of feature learning in weight-tied autoencoders via the mean field lenscited by 13
- 2021The Convex Geometry of Backpropagation: Neural Network Gradient Flows Converge to Extreme Points of the Dual Convex Programcited by 11
- 2022Early Stage Convergence and Global Convergence of Training Mildly Parameterized Neural Networkscited by 5
- 2024Modeling Structured Data Learning with Restricted Boltzmann Machines in the Teacher-Student Settingcited by 2
- 2024Modeling Structured Data Learning with Restricted Boltzmann Machines in the Teacher-Student Setting21 Oct 2024
- 2023The Implicit Regularization of Dynamical Stability in Stochastic Gradient Descent27 May 2023
- 2022Why neural networks find simple solutions: the many regularizers of geometric complexity27 Sep 2022
- 2022Early Stage Convergence and Global Convergence of Training Mildly Parameterized Neural Networks5 Jun 2022
- 2021The Convex Geometry of Backpropagation: Neural Network Gradient Flows Converge to Extreme Points of the Dual Convex Program13 Oct 2021
- 2021Embedding Principle of Loss Landscape of Deep Neural Networks30 May 2021
- 2021Analysis of feature learning in weight-tied autoencoders via the mean field lens16 Feb 2021