Fetching the paper…
Reading the bibliography…
We propose and analyze a new parallel coordinate descent method---`NSync---in which at each iteration a random subset of coordinates is updated, in parallel, allowing for the subsets to be chosen non-uniformly.
A dual coordinate descent method for large-scale linear SVM
C-J. Hsieh, K-W. Chang, C-J. Lin, S.S. Keerthi, , and S. Sundarajan · 2008
Earlier work this paper cites.
Parallel coordinate descent for l1-regularized loss minimization
J. Bradley, A. Kyrola, D. Bickson, and C. Guestrin · 2011
Earlier work this paper cites.
Stochastic Methods for l1-regularized Loss Minimization
S. Shalev-Shwartz and A. Tewari · 2011
Earlier work this paper cites.
Efficiency of randomized coordinate descent methods on optimization problems with linearly coupled constraints
I. Necoara, Yu. Nesterov, and F. Glineur · 2012
Earlier work this paper cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Yu. Nesterov · 2012
Earlier work this paper cites.
Efficient serial and parallel coordinate descent methods for huge-scale truss topology design
P. Richtárik and M. Takáč · 2012
Earlier work this paper cites.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
P. Richtárik and M. Takáč · 2012
Earlier work this paper cites.
Parallel coordinate descent methods for big data optimization
P. Richtárik and M. Takáč · 2012
Earlier work this paper cites.
Proximal stochastic dual coordinate ascent
S. Shalev-Shwartz and T. Zhang · 2012
Cited alongside, same era.
Stochastic block mirror descent methods for nonsmooth and stochastic optimization
C. D. Dang and G. Lan · 2013
Cited alongside, same era.
Parallel coordinate descent for the AdaBoost problem
O. Fercoq · 2013
Cited alongside, same era.
Smooth minimization of nonsmooth functions with parallel coordinate descent methods
O. Fercoq and P. Richtárik · 2013
Cited alongside, same era.
Block-coordinate frank-wolfe optimization for structural svms
S. Lacoste-Julien, M. Jaggi, M. Schmidt, and P. Pletcher · 2013
Cited alongside, same era.
On the complexity analysis of randomized block-coordinate descent methods
Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed mpc
I. Necoara and D. Clipici · 2013
Closest in time.
Distributed coordinate descent method for learning with big data
P. Richtárik and M. Takáč · 2013
Closest in time.
Accelerated mini-batch stochastic dual coordinate ascent
S. Shalev-Shwartz and T. Zhang · 2013
Closest in time.
Stochastic dual coordinate ascent methods for regularized loss minimization
S. Shalev-Shwartz and T. Zhang · 2013
Closest in time.
Mini-batch primal and dual methods for SVMs
M. Takáč, A. Bijral, P. Richtárik, and N. Srebro · 2013
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Z. Lu and L. Xiao · 2013
Cited alongside, same era.
Randomized block coordinate non-monotone gradient methods for a class of nonlinear programming
Z. Lu and L. Xiao · 2013
Cited alongside, same era.
Parallel boosting with momentum
I. Mukherjee, Y. Singer, R. Frongillo, and K. Canini · 2013
Cited alongside, same era.
Parallel coordinate descent Newton for large-scale l1-regularized minimization
Y. Bian, X. Li, and Y. Liu
Cited in the paper.
R. Tappenden, P. Richtárik, and B. Büke · 2013
Closest in time.
Inexact coordinate descent: complexity and preconditioning
R. Tappenden, P. Richtárik, and J. Gondzio · 2013
Closest in time.