Variance reduction via accelerated dual averaging for finite-sum optimization

Abstract

In this paper, we introduce a simplified and unified method for finite-sum convex optimization, named Variance Reduction via Accelerated Dual Averaging (VRADA). In both general convex and strongly convex settings, VRADA can attain an O(n1)-accurate solution in O(n log log n) number of stochastic gradient evaluations which improves the best known result O(n log n), where n is the number of samples. Meanwhile, VRADA matches the lower bound of the general convex setting up to a log log n factor and matches the lower bounds in both regimes n < Θ(K) and n > K of the strongly convex setting, where K denotes the condition number. Besides improving the best known results and matching all the above lower bounds simultaneously, VRADA has more unified and simplified algorithmic implementation and convergence analysis for both the general convex and strongly convex settings. The underlying novel approaches such as the novel initialization strategy in VRADA may be of independent interest. Through experiments on real datasets, we show the good performance of VRADA over existing methods for large-scale machine learning problems.