atlas

Research map / Optimization / Nonconvex and smooth optimization

SGD with AdaGrad Stepsizes: Full Adaptivity with High Probability to Unknown Parameters, Unbounded Gradients and Affine Variance

ICML 2023 · Optimization › Nonconvex and smooth optimization · approach: Stochastic gradient last-iterate analysis · 0 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 stepsizes without knowing the problem parametersSGD with AdaGrad stepsizes · Smooth non-convex optimizationaverage squared gradient norm: \tfrac{1}{T} + \tfrac{\sigma(1+\sigma)}{\sqrt{T}}Helped
Use the same AdaGrad stepsize schedule in the convex settingSGD with AdaGrad stepsizes · Smooth convex optimizationconvex objective gap: \tfrac{1}{T} + \tfrac{\sigma(1+\sigma)}{\sqrt{T}}Helped
Adapt stepsizes to observed gradient magnitudes under affine variance noiseSGD with AdaGrad stepsizes · Smooth convex and non-convex optimizationconvergence rate: O(1/T+\sigma_0/\sqrt{T})Helped

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