mlsanityData to 7 Oct 2026

On the Effect of Initialization: The Scaling Path of 2-Layer Neural Networks

arXiv 2303.17805 ↗First posted 31 Mar 2023cs.LG math.OCcited by 3

Not on the map. Why?

Abstract (arXiv)

In supervised learning, the regularization path is sometimes used as a convenient theoretical proxy for the optimization path of gradient descent initialized from zero. In this paper, we study a modification of the regularization path for infinite-width 2-layer ReLU neural networks with nonzero initial distribution of the weights at different scales. By exploiting a link with unbalanced optimal-transport theory, we show that, despite the non-convexity of the 2-layer network training, this problem admits an infinite-dimensional convex counterpart. We formulate the corresponding functional-optimization problem and investigate its main properties. In particular, we show that, as the scale of the initialization ranges between 0 and +∞, the associated path interpolates continuously between the so-called kernel and rich regimes. Numerical experiments confirm that, in our setting, the scaling path and the final states of the optimization path behave similarly, even beyond these extreme points.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 20 of its 37 references that are in the map. First posted on arXiv 31 Mar 2023.

Builds on

20 of 37 references.

References · 20

  1. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  2. 2018On Lazy Training in Differentiable Programmingcited by 671
  3. 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 562
  4. 2014Breaking the Curse of Dimensionality with Convex Neural Networkscited by 329
  5. 2020Kernel and Rich Regimes in Overparametrized Modelscited by 302
  6. 2020Implicit Bias of Gradient Descent for Wide Two-layer Neural Networks Trained with the Logistic Losscited by 267
  7. 2015A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insightscited by 203
  8. 2019On the Inductive Bias of Neural Tangent Kernelscited by 177
  9. 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 138
  10. 2020Implicit Regularization in Deep Learning May Not Be Explainable by Normscited by 118
  11. 2019A Function Space View of Bounded Norm Infinite Width ReLU Nets: The Multivariate Casecited by 113
  12. 2018Stochastic Modified Equations and Dynamics of Stochastic Gradient Algorithms I: Mathematical Foundationscited by 109
8 more
  1. 2021Implicit Bias of SGD for Diagonal Linear Networks: a Provable Benefit of Stochasticitycited by 107
  2. 2021Gradient Descent on Two-layer Nets: Margin Maximization and Simplicity Biascited by 82
  3. 2022Gradient flow dynamics of shallow ReLU networks for square loss and orthogonal inputscited by 74
  4. 2020The Implicit Regularization of Stochastic Gradient Flow for Least Squarescited by 58
  5. 2021Large Learning Rate Tames Homogeneity: Convergence and Balancing Effectcited by 48
  6. 2020From Optimal Transport to Discrepancycited by 7
  7. 2022Explicit representations for Banach subspaces of Lizorkin distributionscited by 3
  8. 2022A Functional-Space Mean-Field Theory of Partially-Trained Three-Layer Neural Networkscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 0; 2026: 1.

3 papers.