Larger is Better: The Effect of Learning Rates Enjoyed by Stochastic Optimization with Progressive Variance Reduction

Abstract

In this paper, we propose a simple variant of the original stochastic variance reduction gradient (SVRG), where hereafter we refer to as the variance reduced stochastic gradient descent (VR-SGD). Different from the choices of the snapshot point and starting point in SVRG and its proximal variant, Prox-SVRG, the two vectors of each epoch in VR-SGD are set to the average and last iterate of the previous epoch, respectively. This setting allows us to use much larger learning rates or step sizes than SVRG, e.g., 3/(7L) for VR-SGD vs 1/(10L) for SVRG, and also makes our convergence analysis more challenging. In fact, a larger learning rate enjoyed by VR-SGD means that the variance of its stochastic gradient estimator asymptotically approaches zero more rapidly. Unlike common stochastic methods such as SVRG and proximal stochastic methods such as Prox-SVRG, we design two different update rules for smooth and non-smooth objective functions, respectively. In other words, VR-SGD can tackle non-smooth and/or non-strongly convex problems directly without using any reduction techniques such as quadratic regularizers. Moreover, we analyze the convergence properties of VR-SGD for strongly convex problems, which show that VR-SGD attains a linear convergence rate. We also provide the convergence guarantees of VR-SGD for non-strongly convex problems. Experimental results show that the performance of VR-SGD is significantly better than its counterparts, SVRG and Prox-SVRG, and it is also much better than the best known stochastic method, Katyusha.

36 pages, 10 figures. The simple variant of SVRG is much better than the best-known stochastic method, Katyusha

References in corpus (13)

• SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives
• Stochastic Gradient Descent for Non-smooth Optimization: Convergence Results and Optimal Averaging Schemes
• SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradient
• Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization
• From Averaging to Acceleration, There is Only a Step-size
• Accelerated Variance Reduced Stochastic ADMM
• Catalyst Acceleration for Gradient-Based Non-Convex Optimization
• Fast Stochastic Variance Reduced Gradient Method with Momentum Acceleration for Machine Learning
• Stochastic Methods for Composite and Weakly Convex Optimization Problems
• Doubly Accelerated Methods for Faster CCA and Generalized Eigendecomposition
• Linear convergence of SDCA in statistical estimation
• Stochastic Variance-reduced Gradient Descent for Low-rank Matrix Recovery from Linear Measurements
• Guaranteed Sufficient Decrease for Variance Reduced Stochastic Gradient Descent