Fetching the paper…
Reading the bibliography…
We propose mS2GD: a method incorporating a mini-batching scheme for improving the theoretical complexity and practical performance of semi-stochastic gradient descent (S2GD).
H. Robbins and S. Monro, “A stochastic approximation method,” The Annals of Mathematical Statistics , vol. 22, no. 3, pp. 400–407, 1951
1951
Earlier work this paper cites.
J. J. Moreau, “Fonctions convexes duales et points proximaux dans un espace hilbertien,” in Reports of the Paris Academy of Sciences , ser. A, vol. 255, 1962, pp. 2897–2899
1962
Earlier work this paper cites.
R. T. Rockafellar, Convex Analysis . Princeton University Press, 1970
1970
Earlier work this paper cites.
T. Zhang, “Solving large scale linear prediction using stochastic gradient descent algorithms,” in ICML , 2004
2004
Earlier work this paper cites.
Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course . Kluwer, Boston, 2004
2004
Earlier work this paper cites.
D. a. Spielman and S.-H. Teng, “Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems,” vol. 35, no. 3, pp. 835–885, 2006. [Online]. Available: http://arxiv.org/abs/cs/0607105
2006
Earlier work this paper cites.
Y. Nesterov, “Gradient methods for minimizing composite objective function,” CORE Discussion Papers , 2007
2007
Earlier work this paper cites.
P. C. Hansen, “Regularization tools version 4.0 for matlab 7.3,” Numerical algorithms , vol. 46, no. 2, pp. 189–194, 2007
2007
Earlier work this paper cites.
2008
Earlier work this paper cites.
B. Carpenter, “Lazy sparse stochastic gradient descent for regularized multinomial logistic regression,” Technical Report , April 2008
2008
Earlier work this paper cites.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM J. Imaging Sciences , vol. 2, no. 1, pp. 183–202, 2009
2009
Earlier work this paper cites.
T. Strohmer and R. Vershynin, “A Randomized Kaczmarz Algorithm with Exponential Convergence,” Journal of Fourier Analysis and Applications , vol. 15, no. 2, pp. 262–278, 2009
2009
Earlier work this paper cites.
J. Langford, L. Li, and T. Zhang, “Sparse online learning via truncated gradient,” Journal of Machine Learning Research , vol. 10, pp. 777–801, 2009
2009
Earlier work this paper cites.
D. Needell, “Randomized Kaczmarz solver for noisy linear systems,” BIT , vol. 50, no. 2, pp. 395–403, 2010
2010
Earlier work this paper cites.
P. L. Combettes and J.-C. Pesquet, “Proximal splitting methods in signal processing,” in Fixed-Point Algorithms for Inverse Problems in Science and Engineering . Springer, 2011, vol. 49, pp. 185–212
2011
Earlier work this paper cites.
N. Le Roux, M. Schmidt, and F. Bach, “A stochastic gradient method with an exponential convergence rate for finite training sets,” NIPS , pp. 2672–2680, 2012
2012
Cited alongside, same era.
Y. Nesterov, “Efficiency of coordinate descent methods on huge-scale optimization problems,” SIAM J. Optimization , vol. 22, pp. 341–362, 2012
2012
Cited alongside, same era.
2012
Cited alongside, same era.
S. Shalev-Shwartz and T. Zhang, “Stochastic dual coordinate ascent methods for regularized loss,” JMLR , vol. 14, no. 1, pp. 567–599, 2013
2013
Cited alongside, same era.
R. Johnson and T. Zhang, “Accelerating stochastic gradient descent using predictive variance reduction,” NIPS , pp. 315–323, 2013
M. Jaggi, V. Smith, M. Takáč, J. Terhorst, T. Hofmann, and M. I. Jordan, “Communication-efficient distributed dual coordinate ascent,” NIPS , pp. 3068–3076, 2014
2014
Later among the works it cites.
A. Nitanda, “Stochastic proximal gradient descent with acceleration techniques,” NIPS , pp. 1574–1582, 2014
2014
Later among the works it cites.
2014
Later among the works it cites.
L. Xiao and T. Zhang, “A proximal stochastic gradient method with progressive variance reduction,” SIAM Journal on Optimization , vol. 24, no. 4, pp. 2057–2075, 2014
2014
Later among the works it cites.
N. Parikh and S. Boyd, “Proximal algorithms,” Foundations and Trends in Opimization , vol. 1, no. 3, pp. 127–239, 2014
2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
J. Konečný and P. Richtárik, “Semi-stochastic gradient descent methods,” arXiv:1312.1666 , 2013
2013
Cited alongside, same era.
2013
Cited alongside, same era.
2013
Cited alongside, same era.
2013
Cited alongside, same era.
M. Takáč, A. S. Bijral, P. Richtárik, and N. Srebro, “Mini-batch primal and dual methods for SVMs,” ICML , pp. 1022–1030, 2013
2013
Cited alongside, same era.
P. Richtárik and M. Takáč, “Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function,” Mathematical Programming , vol. 144, no. 1-2, pp. 1–38, 2014
2014
Cited alongside, same era.
I. Necoara and A. Patrascu, “A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints,” Comp. Optimization and Applications , vol. 57, no. 2, pp. 307–337, 2014
2014
Cited alongside, same era.
Later among the works it cites.
P. Richtárik and M. Takáč, “Parallel coordinate descent methods for big data optimization,” Mathematical Programming, Series A , pp. 1–52, 2015
2015
Closest in time.
P. L. Combettes and J.-C. Pesquet, “Stochastic quasi-fejér block-coordinate fixed point iterations with random sweeping,” SIAM Journal on Optimization , vol. 25, no. 2, pp. 1221–1248, 2015
2015
Closest in time.
C. Ma, V. Smith, M. Jaggi, M. I. Jordan, P. Richtárik, and M. Takáč, “Adding vs. averaging in distributed primal-dual optimization,” ICML , pp. 1973–1982, 2015
2015
Closest in time.
2015
Closest in time.
P. Oswald and W. Zhou, “Convergence analysis for Kaczmarz-type methods in a Hilbert space framework,” Linear Algebra and its Applications , vol. 478, pp. 131–161, 2015. [Online]. Available: http://linkinghub.elsevier.com/retrieve/pii/S0024379515001925
2015
Closest in time.
R. Needell, Deanna and Srebro, Nathan and Ward, “Stochastic Gradient Descent, Weighted Sampling, and the Randomized Kaczmarz Algorithm,” Mathematical Programming , 2015
2015
Closest in time.
2015
Closest in time.
Z. Qu, P. Richtárik, and T. Zhang, “Randomized dual coordinate ascent with arbitrary sampling,” in NIPS , 2015
2015
Closest in time.