atlas

Research map / Optimization / Nonconvex and smooth optimization

Last Iterate Risk Bounds of SGD with Decaying Stepsize for Overparameterized Linear Regression

ICML 2022 · Optimization › Nonconvex and smooth optimization · approach: Stochastic gradient last-iterate analysis · 1 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 tail geometric stepsize decay (halve stepsize every K steps) with last iterate SGD instead of polynomial decaylast iterate SGD in overparameterized linear regression · instance-wise risk comparison (theory)excess riskNo clear effect
Add tail geometric stepsize decay to last iterate SGD (vs. constant stepsize)last iterate SGD, linear regression · overparameterized linear regression, theoryexcess risk bound orderHelped
Use tail geometric stepsize decay with the last iterate, vs. constant stepsize with averaginglast iterate SGD · theory comparison with iterate averagingexcess risk boundNo 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