Communication-Efficient Distributed Optimization using an Approximate Newton-type Method
Ohad Shamir, Nati Srebro, Tong Zhang
Abstract
Ohad Shamir, Nati Srebro, Tong Zhang
Abstract
We present a novel Newton-type method for dis-tributed optimization, which is particularly well suited for stochastic optimization and learning problems. For quadratic objectives, the method enjoys a linear rate of convergence which prov-ably improves with the data size, requiring an essentially constant number of iterations under reasonable assumptions. We provide theoretical and empirical evidence of the advantages of our method compared to other approaches, such as one-shot parameter averaging and ADMM. 1.
OpenAlex reports 343 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We present a novel Newton-type method for dis-tributed optimization, which is particularly well suited for stochastic optimization and learning problems. For quadratic objectives, the method enjoys a linear rate of convergence which prov-ably improves with the data size, requiring an essentially constant number of iterations under reasonable assumptions. We provide theoretical and empirical evidence of the advantages of our method compared to other approaches, such as one-shot parameter averaging and ADMM. 1.
Key concepts: Convergence (economics), Mathematical optimization, Computer science, Stochastic optimization, Rate of convergence, Constant (computer programming), Newton's method, Optimization problem