Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 283

The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.

Communication-efficient algorithms for statistical optimization

Zhang, Yuchen, Duchi, John C., Wainwright, Martin J.·2012·2012 IEEE 51st IEEE Conference on Decision and Control (CDC)

Abstract

We study two communication-efficient algorithms for distributed statistical optimization on large-scale data. The first algorithm is an averaging method that distributes the N data samples evenly to m machines, performs separate minimization on each subset, and then averages the estimates. We provide a sharp analysis of this average mixture algorithm, showing that under a reasonable set of conditions, the combined parameter achieves mean-squared error that decays as O(N-1+ (N/m)-2). Whenever m ≤ √N, this guarantee matches the best possible rate achievable by a centralized algorithm with access to all N samples. The second algorithm is a novel method, based on an appropriate form of bootstrap. Requiring only a single round of communication, it has mean-squared error that decays as O(N-1+ (N/m)-3), and so is more robust to the amount of parallelization.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/cdc.2012.6426691

Cites

23 of 23 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 23 references

Cited by

See all 283

Metadata

Authors
Zhang, Y., Duchi, J. C., & Wainwright, M. J.
Venue
2012 IEEE 51st IEEE Conference on Decision and Control (CDC)
Publisher
IEEE
Published
2012-12
Volume
25
Pages
6792-6792
OpenAlex
W2571425027
Cited by
283
References
23
FWCI
4.19
Type
conference paper
Language
en
Open access
closed

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Communication-efficient algorithms for statistical optimization. https://app.cochat.ai/papers/10.1109/cdc.2012.6426691
The paper
Zhang, Y., Duchi, J. C., & Wainwright, M. J. (2012). Communication-efficient algorithms for statistical optimization. 2012 IEEE 51st IEEE Conference on Decision and Control (CDC). https://doi.org/10.1109/cdc.2012.6426691

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.