AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

High-Probability Bounds for the Last Iterate of Clipped SGD

Savelii Chezhegov, Daniela Angela Parletta, Andrea Paudice, Eduard Gorbunov

ICLR 2026 · Optimization › Nonconvex and smooth optimization · approach: Stochastic gradient last-iterate analysis

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
evaluate last iterate instead of average iterate of Clipped-SGDClipped-SGD with theory schedules · Pareto-noise logistic objective (d=100)function value (0.95-percentile and mean)Improved
evaluate last iterate instead of average iterate of Clipped-SGDClipped-SGD with theory schedules · Pareto-noise quadratic 0.5||x||^2 (d=100)function valueImproved
evaluate last iterate instead of average iterate of Clipped-SGDClipped-SGD with theory schedules · Heavy-tailed logistic regression (d=10, Student-t 2.001 dof)function valueImproved

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