atlas

Research map / Optimization / Implicit bias and generalization

Global Convergence of Gradient Descent for Deep Linear Residual Networks

NeurIPS 2019 · Optimization › Implicit bias and generalization · approach: Shallow ReLU network convergence · 12 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use ZAS initialization instead of standard Xavier or near-identity initializationGradient descent for one-dimensional deep linear networks · Target Φ = -Iiterations to convergence: \exp(\Omega(L)) versus O\left( L^3 \log(1/\varepsilon) \right)Helped
Use ZAS instead of near-identity initializationGradient descent for a 6-layer linear network · Negative identity matrixsaddle-region escape: 2 of 5Helped
Use mZAS instead of Xavier initializationGradient descent for nonlinear residual networks · Fashion-MNIST (1000 training samples)convergenceHelped
Use mZAS instead of Xavier initializationGradient descent for nonlinear residual networks · Fashion-MNIST, depth L = 2000, 10000optimization stability: 2000, 10000Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy