AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

High-probability Bounds for Non-Convex Stochastic Optimization with Heavy Tails

NeurIPS 2021 · Optimization › Nonconvex and smooth optimization · approach: Stochastic gradient last-iterate analysis · 3 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 burn-in instead of no warm-up or burn-in (ablation)Normalized SGD with clipping and momentum · BERT-Large masked language modeling pretrainingeval accuracyHelped
Use a sufficiently long burn-in period instead of a short burn-in period (ablation)Normalized SGD with clipping and momentum · BERT-Large masked language modeling pretrainingeval accuracyHelped
Use burn-in instead of linear warm-up (ablation)Normalized SGD with clipping and momentum · BERT-Large masked language modeling pretrainingeval accuracy: 62.95% vs. 63.45%Hurt
Replace linear warm-up with burn-in (ablation)LAMB · BERT-Large masked language modeling pretrainingeval accuracyHurt
Use neither warm-up nor burn-in (ablation)LAMB · BERT-Large masked language modeling pretrainingeval accuracyHurt

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