Cited by 17,075Stochastic Gradient Optimization TechniquesDistributed Control Multi-Agent SystemsSparse and Compressive Sensing Techniques

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

Boyd, Stephen, Parikh, Neal, Chu, Eric, Peleato, Borja, Eckstein, Jonathan·2011·Foundations and Trends® in Machine Learning

Abstract

Many problems of recent interest in statistics and machine learning can be posed in the framework of convex optimization. Due to the explosion in size and complexity of modern datasets, it is increasingly important to be able to solve problems with a very large number of features or training examples. As a result, both the decentralized collection or storage of these datasets as well as accompanying distributed solution methods are either necessary or at least highly desirable. In this review, we argue that the alternating direction method of multipliers is well suited to distributed convex optimization, and in particular to large-scale problems arising in statistics, machine learning, and related areas. The method was developed in the 1970s, with roots in the 1950s, and is equivalent or closely related to many other algorithms, such as dual decomposition, the method of multipliers, Douglas–Rachford splitting, Spingarn's method of partial inverses, Dykstra's alternating projections, Bregman iterative algorithms for ℓ1 problems, proximal methods, and others. After briefly surveying the theory and history of the algorithm, we discuss applications to a wide variety of statistical and machine learning problems of recent interest, including the lasso, sparse logistic regression, basis pursuit, covariance selection, support vector machines, and many others. We also discuss general distributed optimization, extensions to the nonconvex setting, and efficient implementation, including some details on distributed MPI and Hadoop MapReduce implementations.

Integrity signals

Registry

Crossref · 10.1561/2200000016

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • With variable splitting techniques, denoiser prior can be plugged in as a modular part of model-based optimization methods to solve other inverse problems.

    “Recent works have revealed that, with the aid of variable splitting techniques, denoiser prior can be plugged in as a modular part of model-based optimization methods to solve other inverse problems (e.g., deblurring).”

    From Learning Deep CNN Denoiser Prior for Image Restoration (2017) · cites this paper as [5]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J.
Affiliations
  • Stanford University (US)
  • Rutgers, The State University of New Jersey (US)
Corresponding author
Boyd, Stephen
Venue
Foundations and Trends® in Machine Learning
Publisher
Emerald
Published
2011-07-26
Volume
3
Issue
1
Pages
1-122
ISSN
  • 1935-8237 (ISSN-L)
  • 1935-8245
OpenAlex
W4292363360
Cited by
17,075
References
3
Citations by year
2026: 928 · 2025: 1357 · 2024: 1490 · 2023: 1542 · 2022: 1478 · 2021: 1463 · 2020: 1675 · 2019: 1712 · 2018: 1464 · 2017: 1214 · 2016: 1014 · 2015: 761 · 2014: 543 · 2013: 286 · 2012: 124
FWCI
285.67
Type
journal article
Language
en
Open access
closed
Locations
Foundations and Trends® in Machine Learning (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Computer Science › Computer Networks and Communications › Distributed Control Multi-Agent Systems
  • Physical Sciences › Engineering › Computational Mechanics › Sparse and Compressive Sensing Techniques
Keywords
alternating direction method of multipliers, distributed convex optimization, statistical learning, large-scale optimization, dual decomposition, Douglas-Rachford splitting, LASSO, sparse logistic regression, basis pursuit, covariance selection, support vector machine, non-convex optimization, MPI, Hadoop MapReduce

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review