2000 character limit reached
Proximal Stochastic Dual Coordinate Ascent
Published 12 Nov 2012 in stat.ML, cs.LG, and math.OC | (1211.2717v1)
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 $\ell_1$ regularization and structured output SVM. The convergence rates we obtain match, and sometimes improve, state-of-the-art results.
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.