AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Corner Gradient Descent

Dmitry Yarotsky

ICLR 2026 · Optimization › Nonconvex and smooth optimization · approach: Stochastic gradient last-iterate analysis · 2 citations (OpenAlex)

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
apply Corner SGD (theta=1.8, memory 5) instead of plain SGDSGD · synthetic indicator problemloss convergence exponent: 0.25 -> 0.45 (theoretical)Improved
apply Corner SGD with theta=1.3 instead of plain SGDSGD · MNIST, batch size 1000 and 100loss convergence exponent: factor ~1.5Improved
raise theta from 1.3 to 1.8 (ablation)Corner SGD · MNIST, batch size 1000acceleration factor: 1.5 -> 1.5No clear effect
raise theta from 1.3 to 1.8 (ablation)Corner SGD · MNIST, batch size 1000training lossImproved
raise theta from 1.3 to 1.8 (ablation)Corner SGD · MNIST, batch size 100stabilityHurt

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