Fetching the paper…
Reading the bibliography…
In this work we propose a distributed randomized block coordinate descent method for minimizing a convex function with a huge number of variables/coordinates.
Upper Saddle River, NJ, USA: Prentice-Hall, Inc., 1989
D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods · 1989
Earlier work this paper cites.
B. K. Natarajan, “Sparse approximate solutions to linear systems,” SIAM journal on computing
1995
Earlier work this paper cites.
Cambridge, MA, USA: MIT Press, 2nd. (revised) ed., 1998
M. Snir, S. Otto, S. Huss-Lederman, D. Walker, and J. Dongarra, MPI-The Complete Reference, Volume 1: The MPI Core · 1998
Earlier work this paper cites.
Athena Scientific, 2nd ed., Sept. 1999
D. P. Bertsekas, Nonlinear Programming · 1999
Earlier work this paper cites.
P. Tseng, “Convergence of a block coordinate descent method for nondifferentiable minimization,” J. Optim. Theory Appl
2001
Earlier work this paper cites.
Z. Q. Luo and P. Tseng, “A coordinate gradient descent method for nonsmooth separable minimization,” J. Optim. Theory Appl
2002
Earlier work this paper cites.
Kluwer, 2004
Y. Nesterov, Introductory lectures on convex optimization · 2004
Earlier work this paper cites.
D. D. Lewis, Y. Yang, T. G. Rose, and F. Li, “Rcv1: A new benchmark collection for text categorization research,” J. Mach. Learn. Res
2004
Earlier work this paper cites.
E. Y. Chang, K. Zhu, H. Wang, H. Bai, J. Li, Z. Qiu, and H. Cui, “PSVM: Parallelizing support vector machines on distributed computers,” Advances in Neural Information Processing Systems
2007
Earlier work this paper cites.
P. Tseng and S. Yun, “A coordinate gradient descent method for nonsmooth separable minimization,” Math. Program
2008
Earlier work this paper cites.
C.-J. Hsieh, K.-W. Chang, C.-J. Lin, S. S. Keerthi, and S. Sundararajan, “A dual coordinate descent method for large-scale linear SVM,” in Proceedings of the 25th International Conference on Machine Learning
2008
Earlier work this paper cites.
P. Tseng and S. Yun, “Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization,” J. Optim. Theory Appl
2009
Earlier work this paper cites.
F. Niu, B. Recht, C. Ré, and S. J. Wright, “Hogwild!: A lock-free approach to parallelizing stochastic gradient descent,” Advances in Neural Information Processing Systems
2011
Earlier work this paper cites.
N. S. M. Salleh, A. Suliman, and A. R. Ahmad, “Parallel execution of distributed SVM using MPI (CoDLib),” in Information Technology and Multimedia (ICIM)
2011
Earlier work this paper cites.
N. K. Alham, M. Li, Y. Liu, and S. Hammoud, “A MapReduce-based distributed SVM algorithm for automatic image annotation,” Comput. Math. Appl
2011
Cited alongside, same era.
D. Ge, X. Jiang, and Y. Ye, “A note on the complexity of ℓ p \ell_{p} minimization,” Math. Program
2011
Cited alongside, same era.
S. Shalev-Shwartz, Y. Singer, N. Srebro, and A. Cotter, “Pegasos: Primal estimated sub-gradient solver for SVM,” Math. Program
2011
Cited alongside, same era.
2012
Cited alongside, same era.
P. Richtárik and M. Takáč, “Efficient serial and parallel coordinate descent methods for huge-scale truss topology design,” in Operations Research Proceedings 2011
2012
Cited alongside, same era.
2013
Later among the works it cites.
2013
Later among the works it cites.
2013
Later among the works it cites.
S. Shalev-Shwartz and T. Zhang, “Stochastic dual coordinate ascent methods for regularized loss,” J. Mach. Learn. Res
2013
Later among the works it cites.
M. Takáč, A. S. Bijral, P. Richtárik, and N. Srebro, “Mini-batch primal and dual methods for SVMs,” J. Mach. Learn. Res
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. Nesterov, “Efficiency of coordinate descent methods on huge-scale optimization problems,” SIAM J. Optimiz
2012
Cited alongside, same era.
C. Scherrer, A. Tewari, M. Halappanavar, and D. Haglin, “Feature clustering for accelerating parallel coordinate descent.,” Advances in Neural Information Processing Systems
2012
Cited alongside, same era.
O. Fercoq and P. Richtárik, “Accelerated, parallel and proximal coordinate descent,” arXiv:1312.5799
2013
Cited alongside, same era.
A. Saha and A. Tewari, “On the finite time convergence of cyclic coordinate descent methods,” SIAM J. Optimiz
2013
Cited alongside, same era.
2013
Cited alongside, same era.
2013
Cited alongside, same era.
2013
Cited alongside, same era.
2013
Later among the works it cites.
P. Richtárik and M. Takáč, “Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function,” Math. Program
2014
Closest in time.
Technical Report, the University of Edinburgh
R. Tappenden, P. Richtárik, and M. Takáč, “Improved complexity analysis of parallel coordinate descent methods,” 2014 · 2014
Closest in time.
R. Tappenden, P. Richtárik, and B. Büke, “Separable approximations and decomposition methods for the augmented lagrangian,” Optim. Method. Softw · 2014
Closest in time.
P. Zhao and T. Zhang, “Stochastic optimization with importance sampling,” arXiv:1401.2753
2014
Closest in time.
O. Fercoq, Z. Qu, P. Richtárik, and M. Takáč, “Fast distributed coordinate descent for non-strongly convex losses,” IEEE Workshop on Machine Learning for Signal Processing
2014
Closest in time.
2014
Closest in time.
M. Jaggi, V. Smith, M. Takáč, J. Terhorst, T. Hofmann, and M. I. Jordan, “Communication-efficient distributed dual coordinate ascent,” Advances in Neural Information Processing Systems
2014
Closest in time.
L. Data, 25/9/2014 · 2014
Closest in time.