paper

Conditional Accelerated Lazy Stochastic Gradient Descent

arXiv:1703.05840

Abstract

In this work we introduce a conditional accelerated lazy stochastic gradient descent algorithm with optimal number of calls to a stochastic first-order oracle and convergence rate improving over the projection-free, Online Frank-Wolfe based stochastic gradient descent of Hazan and Kale [2012] with convergence rate .

arXiv comment37 pages, 9 figures

References in corpus (3)

Cited by in corpus (10)