Fetching the paper…
Reading the bibliography…
We consider a composite convex minimization problem associated with regularized empirical risk minimization, which often arises in machine learning.
Logarithmic regret algorithms for online convex optimization
E. Hazan, A. Agarwal, and S. Kale · 2007
Earlier work this paper cites.
Logarithmic regret algorithms for strongly convex repeated games
S. Shalev-Shwartz and Y. Singer · 2007
Earlier work this paper cites.
Primal-dual subgradient methods for convex problems
Y. Nesterov · 2009
Earlier work this paper cites.
Efficient learning using forward-backward splitting
Y. Singer and J. C. Duchi · 2009
Earlier work this paper cites.
Dual averaging method for regularized stochastic learning and online optimization
L. Xiao · 2009
Earlier work this paper cites.
Better mini-batch algorithms via accelerated gradient methods
A. Cotter, O. Shamir, N. Srebro, and K. Sridharan · 2011
Earlier work this paper cites.
Optimal regularized dual averaging methods for stochastic optimization
X. Chen, Q. Lin, and J. Pena · 2012
Earlier work this paper cites.
Optimal distributed online prediction using mini-batches
O. Dekel, R. Gilad-Bachrach, O. Shamir, and L. Xiao · 2012
Cited alongside, same era.
A stochastic gradient method with an exponential convergence _rate for finite training sets
N. L. Roux, M. Schmidt, and F. R. Bach · 2012
Cited alongside, same era.
Accelerating stochastic gradient descent using predictive variance reduction
R. Johnson and T. Zhang · 2013
Cited alongside, same era.
Introductory lectures on convex optimization: A basic course , volume 87
Y. Nesterov · 2013
Cited alongside, same era.
Minimizing finite sums with the stochastic average gradient
M. Schmidt, N. L. Roux, and F. Bach · 2013
Cited alongside, same era.
Dual averaging and proximal gradient descent for online alternating direction multiplier method
Saga: A fast incremental gradient method with support for non-strongly convex composite objectives
A. Defazio, F. Bach, and S. Lacoste-Julien · 2014
Later among the works it cites.
Stochastic proximal gradient descent with acceleration techniques
A. Nitanda · 2014
Later among the works it cites.
Stochastic dual coordinate ascent with alternating direction method of multipliers
T. Suzuki · 2014
Later among the works it cites.
A proximal stochastic gradient method with progressive variance reduction
L. Xiao and T. Zhang · 2014
Later among the works it cites.
Univr: A universal variance reduction framework for proximal stochastic gradient method
Z. Allen-Zhu and Y. Yuan · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. Suzuki · 2013
Cited alongside, same era.
Accelerated mini-batch stochastic dual coordinate ascent
S. Shalev-Shwartz and T. Zhang
Cited in the paper.
Stochastic dual coordinate ascent methods for regularized loss
S. Shalev-Shwartz and T. Zhang
Cited in the paper.
M. Schmidt, R. Babanezhad, M. O. Ahmed, A. Defazio, A. Clifton, and A. Sarkar · 2015
Later among the works it cites.