How Gradient Descent Balances Features: A Dynamical Analysis For Two-Layer Neural Networks

This paper investigates the fundamental regression task of learning k neurons (a.k.a. teachers) from Gaussian input, using two-layer ReLU neural networks with width m (a.k.a. students) and m, k = O(1), trained via gradient descent under proper initialization and a small step-size. Our analysis follows a threephase structure: alignment after weak recovery, tangential growth, and local convergence, providing deeper insights into the learning dynamics of gradient descent (GD). We prove the global convergence at the rate of O(T −3) for the zero loss of excess risk. Additionally, our results show that GD automatically groups and balances student neurons, revealing an implicit bias toward achieving the minimum "balanced" ℓ 2-norm in the solution. Our work extends beyond previous studies in exact-parameterization setting (m = k = 1, (Yehudai and Ohad, 2020)) and single-neuron setting (m ≥ k = 1, (Xu and Du, 2023)). The key technical challenge lies in handling the interactions between multiple teachers and students during training, which we address by refining the alignment analysis in Phase 1 and introducing a new dynamic system analysis for tangential components in Phase 2. Our results pave the way for further research on optimizing neural network training dynamics and understanding implicit biases in more complex architectures.

Publication Details

Journal
Infoscience (Ecole Polytechnique Fédérale de Lausanne)
Published
2025-04-01
Primary Topic
Stochastic Gradient Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

How Gradient Descent Balances Features: A Dynamical Analysis For Two-Layer Neural Networks

Infoscience (Ecole Polytechnique Fédérale de Lausanne)
Stochastic Gradient Optimization Techniques
article

How Gradient Descent Balances Features: A Dynamical Analysis For Two-Layer Neural Networks

article en

Abstract

This paper investigates the fundamental regression task of learning k neurons (a.k.a. teachers) from Gaussian input, using two-layer ReLU neural networks with width m (a.k.a. students) and m, k = O(1), trained via gradient descent under proper initialization and a small step-size. Our analysis follows a threephase structure: alignment after weak recovery, tangential growth, and local convergence, providing deeper insights into the learning dynamics of gradient descent (GD). We prove the global convergence at the rate of O(T −3) for the zero loss of excess risk. Additionally, our results show that GD automatically groups and balances student neurons, revealing an implicit bias toward achieving the minimum "balanced" ℓ 2-norm in the solution. Our work extends beyond previous studies in exact-parameterization setting (m = k = 1, (Yehudai and Ohad, 2020)) and single-neuron setting (m ≥ k = 1, (Xu and Du, 2023)). The key technical challenge lies in handling the interactions between multiple teachers and students during training, which we address by refining the alignment analysis in Phase 1 and introducing a new dynamic system analysis for tangential components in Phase 2. Our results pave the way for further research on optimizing neural network training dynamics and understanding implicit biases in more complex architectures.

Infoscience (Ecole Polytechnique Fédérale de Lausanne)
Openalex Percentile: Top 20%
Stochastic Gradient Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.