Skip to content

Singular perturbations and hierarchical learning in two-layer neural networks

Jul 2026 · arXiv.org · Vol abs/2607.10869 · 0 citations · 54 references
Computer Science Mathematics

TL;DR

This paper proves that the constant and linear components of the hidden link function are indeed recovered within the predicted timescales, at sharp explicit thresholds, based on quantitative approximation results for singularly perturbed flows evolving near a manifold defined by integral constraints.

Abstract

We study the population gradient flow of an infinitely wide two-layer neural network learning a misspecified single-index model in high dimension. The two layers are optimized jointly, with a perturbative parameter tuning the relative training speed between the first and second layer. This setting was considered by Berthier, Montanari and Zhou in \cite{berthier2024learning}, who conjectured a hierarchical learning scenario with explicit timescales as the second layer is trained faster than the first. In this paper, we prove that the constant and linear components of the hidden link function are indeed recovered within the predicted timescales, at sharp explicit thresholds. We then analyze the onset of learning of the quadratic component and show that the components learned at earlier stages continue to influence the dynamics in an essential way. Our proof is based on quantitative approximation results for singularly perturbed flows evolving near a manifold defined by integral constraints. At a phenomenological level, we also show that the empirical measure of the weights displays singular behaviour when reaching the quadratic component of the hidden link, with a small fraction of neurons growing significantly while the remaining ones rearrange to preserve the components already learned.

View source

Similar papers

#machine learning Preprint Sep 2026

A Theoretical Analysis of Generalization Dynamics in Neural Networks under Gradient Descent with Weight Decay

A broad class of neural networks trained under the $\ell^2$ loss by gradient descent with weight decay with weight decay is studied, and the convergence of GD to a neighbourhood of the global minimizers of the empirical loss is proved.

Yu-Qing Wang, I. Kevrekidis, Mikhail Belkin · 1 citation
Preprint Aug 2026

Neural Quadratic Forms: A Unified Minimal Model for Sudden Learning and Scaling Laws

It is shown that a symmetry fixes what variables are: a network layer is a sum over interchangeable units, so relabeling the units leaves it unchanged; given smoothness and the condition that a unit's gradient vanish at the origin, symmetry then enforces a universal leading form for the expansion about the near-zero we...

Zi-Yin Liu, Yi-Zhou Xu, Tomaso A. Poggio et al. · 0 citations
Preprint Sep 2026

A simple shallow neural network for emulating the solution to singularly perturbed problems

A shallow NN is described which exploits available asymptotic expansions for the solution to singularly perturbed second order boundary value problems, with two small parameters, to augment the approximation space with suitable exponential functions, similar to enriched spaces in finite element methods.

C. Xenophontos, Aayushman Raina · 0 citations

Geodesics and Low Rank Behavior in the Deep Linear Network

A general system of ordinary differential equations describing geodesics in the DLN is derived and an investigation into using an entropic log-volume form related to the geometry on the full-rank manifold as an explicit regularizer for a simple class of energies is investigated.

Alan Chen, Govind Menon · 0 citations
#machine learning Preprint Sep 2026

SGD in Multiclass Logistic Regression: Sequential Learning and Scaling Laws

Theoretical scaling laws from linear regression to multiclass classification to multiclass classification are extended, while connecting to empirical scaling laws observed in large-scale neural networks.

Konstantinos Christopher Tsiolis, Denny Wu, Christos Thrampoulidis et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.