AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Adaptive SVRG Methods under Error Bound Conditions with Unknown Growth Parameter

Yi Xu, Qihang Lin, Tianbao Yang

NeurIPS 2017 · Optimization › Nonconvex and smooth optimization · approach: Stochastic variance reduction

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
Adaptive search for unknown QEB growth parameter c (SVRGQEB-RS) versus SVRGHEB with fixed initial T1 (ablation)SVRG under QEB · Adult, squared hinge + l1 normobjective gap (log scale) over #grad/nImproved
Adaptive search for c makes performance insensitive to initial T1 estimate (ablation)SVRGQEB-RS · Adult, squared hinge + l1 normobjective gap sensitivity to initial T1Improved
Replace fixed-epoch SVRG++ baseline with SVRGQEB-RSSVRG under QEB · Adult, logistic / squared hinge / square / Huber / lp regressionobjective gap over #grad/nImproved
Heuristic automatic epoch length (SVRG-heuristics) with 2n capSVRG++ · multiple datasetsobjective gap over #grad/nMixed
Restart-based search for c for theta=1/2 (Algorithm 2 cannot be applied at theta=1/2) (ablation)SVRGHEB-RS · theta=1/2convergence guaranteeNo 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