Proximal Stochastic Dual Coordinate Ascent
Abstract
We introduce a proximal version of dual coordinate ascent method. We demonstrate how the derived algorithmic framework can be used for numerous regularized loss minimization problems, including 1 regularization and structured output SVM. The convergence rates we obtain match, and sometimes improve, state-of-the-art results.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.