Fetching the paper…
Reading the bibliography…
It is well known that the optimal convergence rate for stochastic optimization of smooth functions is $O(1/\sqrt{T})$, which is same as stochastic optimization of Lipschitz continuous convex functions.
Problem complexity and method efficiency in optimization
A. S. Nemirovsky and D. B. Yudin · 1983
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate o (1/k2)
Y. Nesterov · 1983
Earlier work this paper cites.
Mirror descent and nonlinear projected subgradient methods for convex optimization
A. Beck and M. Teboulle · 2003
Earlier work this paper cites.
Concentration inequalities
S. Boucheron, G. Lugosi, and O. Bousquet · 2003
Earlier work this paper cites.
Convex Optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Y. Nesterov · 2004
Earlier work this paper cites.
Excessive gap technique in nonsmooth convex minimization
Y. Nesterov · 2005
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
Earlier work this paper cites.
Logarithmic regret algorithms for online convex optimization
E. Hazan, A. Agarwal, and S. Kale · 2007
Cited alongside, same era.
Pegasos: Primal estimated sub-gradient solver for svm
S. Shalev-Shwartz, Y. Singer, and N. Srebro · 2007
Cited alongside, same era.
The tradeoffs of large scale learning
L. Bottou and O. Bousquet · 2008
Cited alongside, same era.
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Cited alongside, same era.
A smoothing stochastic gradient method for composite optimization
Q. Lin, X. Chen, and J. Pena · 2010
Cited alongside, same era.
Better mini-batch algorithms via accelerated gradient methods
A. Cotter, O. Shamir, N. Srebro, and K. Sridharan · 2011
Optimal distributed online prediction using mini-batches
O. Dekel, R. Gilad-Bachrach, O. Shamir, and L. Xiao · 2012
Later among the works it cites.
Making gradient descent optimal for strongly convex stochastic optimization
A. Rakhlin, O. Shamir, and K. Sridharan · 2012
Later among the works it cites.
A stochastic gradient method with an exponential convergence rate for finite training sets
N. L. Roux, M. W. Schmidt, and F. Bach · 2012
Later among the works it cites.
Stochastic dual coordinate ascent methods for regularized loss minimization
S. Shalev-Shwartz and T. Zhang · 2013
Closest in time.
Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes
O. Shamir and T. Zhang · 2013
Closest in time.
Recovering the optimal solution by dual random projection
L. Zhang, M. Mahdavi, R. Jin, and T. Yang · 2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization
E. Hazan and S. Kale · 2011
Cited alongside, same era.
Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization
A. Agarwal, P. L. Bartlett, P. D. Ravikumar, and M. J. Wainwright · 2012
Cited alongside, same era.
Closest in time.
O(logt) projections for stochastic optimization of smooth and strongly convex functions
L. Zhang, T. Yang, R. Jin, and X. He · 2013
Closest in time.