2000 character limit reached
Scaling Up Coordinate Descent Algorithms for Large $\ell_1$ Regularization Problems
Published 27 Jun 2012 in cs.LG, cs.DC, and stat.ML | (1206.6409v1)
Abstract: We present a generic framework for parallel coordinate descent (CD) algorithms that includes, as special cases, the original sequential algorithms Cyclic CD and Stochastic CD, as well as the recent parallel Shotgun algorithm. We introduce two novel parallel algorithms that are also special cases---Thread-Greedy CD and Coloring-Based CD---and give performance measurements for an OpenMP implementation of these.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.