atlas

Research map / Optimization / Implicit bias and generalization

Overparameterized Nonlinear Learning: Gradient Descent Takes the Shortest Path?

ICML 2019 · Optimization › Implicit bias and generalization · approach: Neural tangent kernel analysis · 88 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
Require the Jacobian to be well-conditioned and have bounded or smooth variation near initializationgradient descent on overparameterized nonlinear least-squares problems · overparameterized nonlinear learningtraining residualHelped
Use the proposed local-Jacobian conditions for stochastic gradient descentSGD on overparameterized nonlinear least-squares problems · overparameterized nonlinear learningtraining residualHelped
Use the martingale-based neighborhood argument to permit larger learning ratesSGD on overparameterized nonlinear least-squares problems · overparameterized nonlinear learninglearning rateHelped
Increase the MNIST sample size from n=500 to n=5000LeNet trained with Adam · MNIST, normalized misfit 0.2FC2 normalized distance: 0.25 -> 0.5Mixed

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