2014Unpublished venueRequires access

Communication-Efficient Distributed Optimization using an Approximate Newton-type Method

Ohad Shamir, Nati Srebro, Tong Zhang

Open publisher page 343 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 343 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Convergence (economics), Mathematical optimization, Computer science, Stochastic optimization, Rate of convergence, Constant (computer programming), Newton's method, Optimization problem

Related papers

Back to paper searchBrowse research topicsOriginal source
Communication-Efficient Distributed Optimization using an Approximate Newton-type Method — Research Paper | ScholarLens