AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

High-Probability Bounds for Stochastic Optimization and Variational Inequalities: the Case of Unbounded Variance

ICML 2023 · Optimization › Nonconvex and smooth optimization · approach: Stochastic gradient last-iterate analysis · 5 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
add gradient clipping to SGD for alpha-th moment noise (alpha in (1,2]), smooth convex/strongly convex settingsSGD · smooth minimization, unbounded variancehigh-probability complexityHelped
SGD without clipping under bounded varianceSGD · strongly convex quadratic, alpha=2 lower-bound constructioniterations to reach P{||x^K-x*||^2>=eps}<=betaHurt
restart clipped-SSTM in strongly convex caseclipped-SSTM · strongly convex minimizationhigh-probability complexityHelped
use clipped-SEG instead of unclipped methods for monotone VIP with alpha<2extragradient for VIP · Lipschitz monotone VIP, unbounded variancehigh-probability complexityNo 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