Timezone: »

 
Poster
Breaking the Nonsmooth Barrier: A Scalable Parallel Method for Composite Optimization
Fabian Pedregosa · Rémi Leblond · Simon Lacoste-Julien

Wed Dec 06 06:30 PM -- 10:30 PM (PST) @ Pacific Ballroom #159
in Posters Wed »

Due to their simplicity and excellent performance, parallel asynchronous variants of stochastic gradient descent have become popular methods to solve a wide range of large-scale optimization problems on multi-core architectures. Yet, despite their practical success, support for nonsmooth objectives is still lacking, making them unsuitable for many problems of interest in machine learning, such as the Lasso, group Lasso or empirical risk minimization with convex constraints. In this work, we propose and analyze ProxASAGA, a fully asynchronous sparse method inspired by SAGA, a variance reduced incremental gradient algorithm. The proposed method is easy to implement and significantly outperforms the state of the art on several nonsmooth, large-scale problems. We prove that our method achieves a theoretical linear speedup with respect to the sequential version under assumptions on the sparsity of gradients and block-separability of the proximal term. Empirical benchmarks on a multi-core architecture illustrate practical speedups of up to 12x on a 20-core machine.

Keywords: Online Learning · Convex Optimization · Stochastic Methods · Optimization · Sparsity and Compressed Sensing

Author Information

Fabian Pedregosa (UC Berkeley / ETH Zurich)
Rémi Leblond (INRIA)
Simon Lacoste-Julien (Université de Montréal)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors