Coordinate Descent with Arbitrary Sampling I: Algorithms and Complexity

  title={Coordinate Descent with Arbitrary Sampling I: Algorithms and Complexity},
  author={Zheng Qu and Peter Richt{\'a}rik},
  journal={Optimization Methods and Software},
We study the problem of minimizing the sum of a smooth convex function and a convex blockseparable regularizer and propose a new randomized coordinate descent method, which we call ALPHA. Our method at every iteration updates a random subset of coordinates, following an arbitrary distribution. No coordinate descent methods capable to handle an arbitrary sampling have been studied in the literature before for this problem. ALPHA is a remarkably flexible algorithm: in special cases, it reduces to… CONTINUE READING
Highly Cited
This paper has 60 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 4 times over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
41 Extracted Citations
43 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.

Similar Papers

Loading similar papers…