atlas

Research map / Optimization / Nonconvex and smooth optimization

Variance Reduction for Faster Non-Convex Optimization

ICML 2016 · Optimization › Nonconvex and smooth optimization · approach: Proximal finite-sum methods · 119 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 SVRG variance reduction instead of full gradient descentSmooth finite-sum non-convex optimization · Smooth finite-sum non-convex optimizationstochastic gradient iterations: Ω(n1/3) times faster than GDHelped
Use SVRG for non-convex sigmoid-loss ERMℓ2-regularized ERM · ERM with sigmoid losstesting accuracyMixed
Use SVRG rather than SGD for sigmoid-loss ERMℓ2-regularized ERM · ERM with sigmoid losstraining objectiveMixed
Use SVRG-based algorithms rather than SGD or AdaGradToy neural networks · CIFAR-10 and MNISTtraining objectiveHelped
Initialize each epoch with a weighted average of recent iterates (ablation)SVRG-1 · CIFAR-10 and MNISTtraining objectiveHelped
Use adaptive learning rates (ablation)SVRG-2 · CIFAR-10 and MNISTtraining objectiveHelped
Reduce mini-batch size to 16 (ablation)SVRG-3 · CIFAR-10 and MNISTtraining objectiveHelped
Reduce mini-batch size (ablation)SGD or AdaGrad · CIFAR-10 and MNISTtraining objectiveHurt

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