Variance reduction has emerged in recent years as a strong competitor to stochastic gradient descent in non-convex problems, providing the first algorithms to improve upon the converge rate of stochastic gradient descent for finding first-order critical points. However, variance reduction techniques typically require carefully tuned learning rates and willingness to use excessively large "mega-batches" in order to achieve their improved results. We present a new variance reduction algorithm, Storm, that does not require any batches and makes use of adaptive learning rates, enabling simpler implementation and less tuning of hyperparameters. Our technique for removing the batches uses a variant of momentum to achieve variance reduction in non-convex optimization. On smooth losses F , Storm finds a point ) in T iterations with σ 2 variance in the gradients, matching the optimal rate but without requiring knowledge of σ.
In the non-convex setting, STORM REF ) uses a variant of momentum for variance reduction.
Momentum-Based Variance Reduction in Non-Convex SGD
ArXiv
ArXiv
Computer Science Mathematics