pith. sign in

arxiv: 2505.04898 · v1 · pith:ECMV5OHNnew · submitted 2025-05-08 · 💻 cs.LG · cs.AI· math.OC· math.ST· stat.ML· stat.TH

Precise gradient descent training dynamics for finite-width multi-layer neural networks

classification 💻 cs.LG cs.AImath.OCmath.STstat.MLstat.TH
keywords theorydescentgradientneuralregimeexistingfinite-widthgeneralization
0
0 comments X
read the original abstract

In this paper, we provide the first precise distributional characterization of gradient descent iterates for general multi-layer neural networks under the canonical single-index regression model, in the `finite-width proportional regime' where the sample size and feature dimension grow proportionally while the network width and depth remain bounded. Our non-asymptotic state evolution theory captures Gaussian fluctuations in first-layer weights and concentration in deeper-layer weights, and remains valid for non-Gaussian features. Our theory differs from existing neural tangent kernel (NTK), mean-field (MF) theories and tensor program (TP) in several key aspects. First, our theory operates in the finite-width regime whereas these existing theories are fundamentally infinite-width. Second, our theory allows weights to evolve from individual initializations beyond the lazy training regime, whereas NTK and MF are either frozen at or only weakly sensitive to initialization, and TP relies on special initialization schemes. Third, our theory characterizes both training and generalization errors for general multi-layer neural networks beyond the uniform convergence regime, whereas existing theories study generalization almost exclusively in two-layer settings. As a statistical application, we show that vanilla gradient descent can be augmented to yield consistent estimates of the generalization error at each iteration, which can be used to guide early stopping and hyperparameter tuning. As a further theoretical implication, we show that despite model misspecification, the model learned by gradient descent retains the structure of a single-index function with an effective signal determined by a linear combination of the true signal and the initialization.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The Geometry of Statistical Feature Learning in Mean-Field Langevin Dynamics

    math.ST 2026-06 unverdicted novelty 7.0

    Spherical mean-field Langevin dynamics concentrate near hidden indices in Gaussian multi-index models with a sharp temperature transition at λ ≃ 1 and achieve d/N and Md/N rates in single-index models via Lévy-Milman ...

  2. Convergence of Gradient Descent for General Neural Network Architectures Beyond the NTK Regime

    cs.LG 2026-06 unverdicted novelty 7.0

    Proves GD convergence to stationary point neighborhoods for general NN architectures beyond NTK via block-level analysis, analyticity, and local smoothness conditions.

  3. Statistical Inference on Gradient Flows

    math.ST 2026-05 unverdicted novelty 7.0

    Proves uniform CLT for gradient flows in ERM and constructs an algorithm-aware, inversion-free covariance estimator for asymptotically valid time-uniform confidence intervals.