atlas

Research map / Optimization / Nonconvex and smooth optimization

AdaGrad Stepsizes: Sharp Convergence Over Nonconvex Landscapes

ICML 2019 · Optimization › Nonconvex and smooth optimization · approach: Stochastic gradient last-iterate analysis · 170 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 AdaGrad-Norm (single adaptive stepsize) instead of fixed-stepsize SGDSGD on smooth nonconvex / linear regression · Synthetic Gaussian linear regressiongradient norm convergence across b0Helped
Use AdaGrad-Norm instead of SGD with fixed/decaying stepsizedeep networks · MNIST, CIFAR10, ImageNettest accuracy sensitivity to b0Helped
Use AdaGrad-Norm with very small initial b0 instead of SGDdeep networks · MNIST, CIFAR10test accuracyNo clear effect
Large initial b0 (small effective stepsize) for AdaGrad-NormAdaGrad-Norm on linear regression · Synthetic Gaussian linear regressiongradient norm convergence speedNo clear effect
Per-neuron / per-channel stepsize (instead of strict global norm) in neural network AdaGrad-Norm implementationAdaGrad-Norm on ResNet and MLPs · image classificationgeneralizationNo 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