Name
Abstract | ||
|---|---|---|
With the growth of data and necessity for distributed optimization methods, solvers that work well on a single machine must be re-designed to leverage distributed computation. Recent work in this area has been limited by focusing heavily on developing highly specific methods for the distributed environment. These special-purpose methods are often unable to fully leverage the competitive performance of their well-tuned and customized single machine counterparts. Further, they are unable to easily integrate improvements that continue to be made to single machine methods. To this end, we present a framework for distributed optimization that both allows the flexibility of arbitrary solvers to be used on each single machine locally and yet maintains competitive performance against other state-of-the-art special-purpose distributed methods. We give strong primal–dual convergence rate guarantees for our framework that hold for arbitrary local solvers. We demonstrate the impact of local solver selection both theoretically and in an extensive experimental comparison. Finally, we provide thorough implementation details for our framework, highlighting areas for practical performance gains. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1080/10556788.2016.1278445 | Optimization Methods and Software |
Keywords | DocType | Volume |
primal-dual algorithm,distributed computing,machine learning,convergence analysis | Journal | abs/1512.04039 |
Issue | ISSN | Citations |
4 | 1055-6788 | 32 |
PageRank | References | Authors |
1.47 | 48 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chenxin Ma | 1 | 73 | 5.25 |
| Jakub Konecný | 2 | 363 | 19.21 |
| Martin Jaggi | 3 | 852 | 54.16 |
| Virginia Smith | 4 | 339 | 20.52 |
| Michael I. Jordan | 5 | 31220 | 3640.80 |
| Peter Richtárik | 6 | 1314 | 84.53 |
| Martin Takác | 7 | 752 | 49.49 |