AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

High Probability Convergence Bounds for Non-convex Stochastic Gradient Descent with Sub-Weibull Noise

Liam Madden, Emiliano Dall'Anese, Stephen Becker

JMLR 2024 · 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
increase noise tail heaviness theta from 2 to 4SGD convergence error · Synthetic two-layer GELU net, delta in [0.001,0.01]fitted exponent of log(1/delta): 1.40 -> 4.08Hurt
increase noise tail heaviness theta from 2 to 4SGD convergence error · Synthetic two-layer GELU net, delta in [0.1,0.2]fitted exponent of log(1/delta): 0.64 -> 1.51Hurt
consider smaller failure probability delta rangesSGD convergence error exponent · Synthetic two-layer GELU net, theta=3fitted exponent of log(1/delta): 0.93 -> 1.56 -> 2.33Hurt

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