AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Sharpness, Restart and Acceleration

Vincent Roulet, Alexandre d'Aspremont

NeurIPS 2017 · Learning theory and algorithms › Sample complexity · approach: Statistical-query lower bounds

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
restart schemes (Adap, Crit, Mono) instead of plain accelerated gradientAccelerated gradient with restart · Least squares on UCI Sonarf(x)-f*Improved
restart schemes instead of plain accelerated gradientAccelerated gradient with restart · Logistic loss on UCI Sonarf(x)-f*No clear effect
scheduled restart instead of restart heuristicsAccelerated gradient with restart · Dual SVM (hinge loss, regularized) on Sonarf(x)-f*Improved
restart schemes instead of plain accelerated gradientAccelerated gradient with restart · LASSOf(x)-f*Improved
adaptive restart (Adap) instead of critical-parameter restart (Crit)Accelerated gradient with restart · Dual SVM and LASSOconvergence consistencyImproved

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