atlas

Research map / Optimization / Implicit bias and generalization

Fast Convergence of Natural Gradient Descent for Over-Parameterized Neural Networks

NeurIPS 2019 · Optimization › Implicit bias and generalization · approach: Gradient flow and mean-field dynamics

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 exact natural gradient descent instead of gradient descentTwo-layer ReLU networks · Overparameterized networks, squared errorconvergence rate: \mathcal{O}(\lambda_0 / n) improvementHelped
Use exact natural gradient descent instead of gradient descentTwo-layer ReLU networks · Overparameterized networksmaximum allowable learning rate: \mathcal{O}(1/n) to \mathcal{O}(1)Helped
Use K-FAC as an approximate natural-gradient optimizerTwo-layer ReLU networks · Overparameterized networksconvergence to a global minimum: linear rateHelped
Apply a data transformation followed by normalization to make the input covariance condition number 1K-FAC · Two-layer ReLU networksconvergence bound: \kappa_{\mathbf{Z}^\top \mathbf{Z}} = 1Helped
Use natural gradient descent while training near initializationTwo-layer ReLU networks · Generalizationexpected loss upper bound: matches the bound for gradient descentNo clear effect

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