Fetching the paper…
Reading the bibliography…
Recent work by Nesterov and Stich showed that momentum can be used to accelerate the rate of convergence for block Gauss-Seidel in the setting where a fixed partitioning of the coordinates is chosen ahead of time.
Learning with Kernels
B. Schölkopf and A. J. Smola · 2001
Earlier work this paper cites.
The Schur Complement and its Applications
F. Zhang · 2005
Earlier work this paper cites.
Random Features for Large-Scale Kernel Machines
A. Rahimi and B. Recht · 2007
Earlier work this paper cites.
A Randomized Kaczmarz Algorithm with Exponential Convergence
T. Strohmer and R. Vershynin · 2009
Earlier work this paper cites.
A Coordinate Gradient Descent Method for Nonsmooth Separable Minimization
P. Tseng and S. Yun · 2009
Earlier work this paper cites.
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
D. Leventhal and A. S. Lewis · 2010
Earlier work this paper cites.
Learning Feature Representations with K-Means
A. Coates and A. Y. Ng · 2012
Earlier work this paper cites.
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
Y. Nesterov · 2012
Earlier work this paper cites.
Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems
Y. T. Lee and A. Sidford · 2013
Earlier work this paper cites.
Parallel Stochastic Gradient Algorithms for Large-Scale Matrix Completion
B. Recht and C. Ré · 2013
Earlier work this paper cites.
An Accelerated Proximal Coordinate Gradient Method
Q. Lin, Z. Lu, and L. Xiao · 2014
Earlier work this paper cites.
Paved with Good Intentions: Analysis of a Randomized Block Kaczmarz Method
D. Needell and J. A. Tropp · 2014
Cited alongside, same era.
Coordinate Descent with Arbitrary Sampling I: Algorithms and Complexity
Z. Qu and P. Richtárik · 2014
Cited alongside, same era.
Coordinate Descent with Arbitrary Sampling II: Expected Separable Overapproximation
Z. Qu and P. Richtárik · 2014
Cited alongside, same era.
Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function
P. Richtárik and M. Takác̆ · 2014
Cited alongside, same era.
Accelerated, Parallel, and Proximal Coordinate Descent
O. Fercoq and P. Richtárik · 2015
Cited alongside, same era.
Randomized Iterative Methods for Linear Systems
R. M. Gower and P. Richtárik · 2015
Cited alongside, same era.
Random Permutations Fix a Worst Case for Cyclic Coordinate Descent
C.-P. Lee and S. J. Wright · 2016
Later among the works it cites.
An Accelerated Randomized Kaczmarz Algorithm
J. Liu and S. J. Wright · 2016
Later among the works it cites.
Efficiency of Accelerated Coordinate Descent Method on Structured Optimization Problems
Y. Nesterov and S. Stich · 2016
Later among the works it cites.
Convergence Rates for Greedy Kaczmarz Algorithms, and Faster Randomized Kaczmarz Rules Using the Orthogonality Graph
J. Nutini, B. Sepehry, I. Laradji, M. Schmidt, H. Koepke, and A. Virani · 2016
Later among the works it cites.
SDNA: Stochastic Dual Newton Ascent for Empirical Risk Minimization
Z. Qu, P. Richtárik, M. Takác̆, and O. Fercoq · 2016
Later among the works it cites.
Large Scale Kernel Learning using Block Coordinate Descent
S. Tu, R. Roelofs, S. Venkataraman, and B. Recht · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On the Complexity Analysis of Randomized Block-Coordinate Descent Methods
Z. Lu and L. Xiao · 2015
Cited alongside, same era.
Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection
J. Nutini, M. Schmidt, I. H. Laradji, M. Friedlander, and H. Koepke · 2015
Cited alongside, same era.
Randomized Dual Coordinate Ascent with Arbitrary Sampling
Z. Qu, P. Richtárik, and T. Zhang · 2015
Cited alongside, same era.
Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling
Z. Allen-Zhu, P. Richtárik, Z. Qu, and Y. Yuan · 2016
Cited alongside, same era.
A Flexible Coordinate Descent Method
K. Fountoulakis and R. Tappenden · 2016
Cited alongside, same era.
Later among the works it cites.
A Lyapunov Analysis of Momentum Methods in Optimization
A. C. Wilson, B. Recht, and M. I. Jordan · 2016
Later among the works it cites.
Faster Kernel Ridge Regression Using Sketching and Preconditioning
H. Avron, K. L. Clarkson, and D. P. Woodruff · 2017
Closest in time.
FALKON: An Optimal Large Scale Kernel Method
A. Rudi, L. Carratino, and L. Rosasco · 2017
Closest in time.
KeystoneML: Optimizing Pipelines for Large-Scale Advanced Analytics
E. R. Sparks, S. Venkataraman, T. Kaftan, M. Franklin, and B. Recht · 2017
Closest in time.