atlas

Research map / Optimization / Nonconvex and smooth optimization

Gradient Projection Iterative Sketch for Large-Scale Constrained Least-Squares

ICML 2017 · Optimization › Nonconvex and smooth optimization · approach: Stochastic variance reduction · 22 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
Replace full accelerated projected gradient with GPIS (sketched gradient projection with Count-sketch and line search) for constrained LSGPIS · Syn1/Syn2/Syn3/Magic04 constrained LS (wall-clock time)wall-clock time to reach relative errorHelped
Use sketched deterministic iterations instead of mini-batch SAGAGPIS / Acc-GPIS · Syn1, Syn2, Magic04 (wall-clock time)wall-clock timeHelped
Use mini-batch SAGA (b=10) in place of sketched methods on constrained problems with costly projectionSAGA b=10 · Syn3 nuclear-norm constrained (wall-clock time)wall-clock timeHurt
Full accelerated PGD rather than sketched methods on Syn3 (nuclear-norm)Acc-PGD · Syn3 low-rank (wall-clock time)wall-clock timeHelped
Run GPCS initialization loop (classical sketch warm start) before GPIHS iterationsGPIS · regression on real data setsconvergence speedNo clear effect
Add Nesterov acceleration with gradient restart to GPIS (Acc-GPIS)Acc-GPIS · theory: outer-loop rateconvergence rateHelped

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