mlsanityData to 7 Oct 2026

Global Convergence of Gradient Descent for Deep Linear Residual Networks

arXiv 1911.00645 ↗First posted 2 Nov 2019cs.LG stat.MLcited by 16

Not on the map. Why?

Abstract (arXiv)

We analyze the global convergence of gradient descent for deep linear residual networks by proposing a new initialization: zero-asymmetric (ZAS) initialization. It is motivated by avoiding stable manifolds of saddle points. We prove that under the ZAS initialization, for an arbitrary target matrix, gradient descent converges to an varepsilon-optimal point in O(L3 log(1/varepsilon)) iterations, which scales polynomially with the network depth L. Our result and the exp(Omega(L)) convergence time for the standard initialization (Xavier or near-identity) [Shamir, 2018] together demonstrate the importance of the residual structure and the initialization in the optimization for deep linear neural networks, especially when L is large.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Nov 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 5; 2022: 2; 2023: 4; 2024: 2; 2025: 2; 2026: 1.

16 papers.

Sort: