paper-with-me

Papers

Stochastic Gradient Descent in the Saddle-to-Saddle Regime of Deep Linear Networks

2026-04-07 · Guillaume Corlouer, Avi Semler, Alexander Strang, Alexander Gietelink Oldenziel arxiv

Deep linear networks (DLNs) are used as an analytically tractable model of the training dynamics of deep neural networks. While gradient descent in DLNs is known to exhibit saddle-to-saddle dynamics, the impact of stochastic gradient descent (SGD) noise on this regime remains poorly understood. We investigate the dynamics of SGD during training of DLNs in the saddle-to-saddle regime. We model the training dynamics as stochastic Langevin dynamics with anisotropic, state-dependent noise. Under the assumption of aligned and balanced weights, we derive an exact decomposition of the dynamics into a system of one-dimensional per-mode stochastic differential equations. This establishes that the maximal diffusion along a mode precedes the corresponding feature being completely learned. We also derive the stationary distribution of SGD for each mode: in the absence of label noise, its marginal distribution along specific features coincides with the stationary distribution of gradient flow, while in the presence of label noise it approximates a Boltzmann distribution. Finally, we confirm experimentally that the theoretical results hold qualitatively even without aligned or balanced weights. These results establish that SGD noise encodes information about the progression of feature learning but does not fundamentally alter the saddle-to-saddle dynamics.

📄 PDF Abstract BibTeX arXiv:2604.06366

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Type-II Saddles and Probabilistic Stability of Stochastic Gradient Descent

2023-03-23 · Liu Ziyin, Botao Li, Tomer Galanti, Masahito Ueda

Characterizing and understanding the dynamics of stochastic gradient descent (SGD) around saddle points remains an open problem. We first show that saddle points in neural networks can be divided into two types, among wh…

Learning Theory

Distributed Learning in Non-Convex Environments -- Part II: Polynomial Escape from Saddle-Points

2019-07-03 · Stefan Vlaski, Ali H. Sayed

The diffusion strategy for distributed learning from streaming data employs local stochastic gradient updates along with exchange of iterates over neighborhoods. In Part I [2] of this work we established that agents clus…

Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decomposition

2015-03-06 · Rong Ge, Furong Huang, Chi Jin, Yang Yuan

We analyze stochastic gradient descent for optimizing non-convex functions. In many cases for non-convex functions the goal is to find a reasonable local minimum, and the main concern is that gradient updates are trapped…

Tensor Decomposition

Notes on Worst-case Inefficiency of Gradient Descent Even in R^2

2020-08-17 · Shiliang Zuo

Gradient descent is a popular algorithm in optimization, and its performance in convex settings is mostly well understood. In non-convex settings, it has been shown that gradient descent is able to escape saddle points a…

Stochastic noise can be helpful for variational quantum algorithms

2022-10-13 · Junyu Liu, Frederik Wilde, Antonio Anna Mele, Xin Jin 외

Saddle points constitute a crucial challenge for first-order gradient descent algorithms. In notions of classical machine learning, they are avoided for example by means of stochastic gradient descent methods. In this wo…