CoChat

MATCHA: Speeding Up Decentralized SGD via Matching Decomposition Sampling

Open access
Wang, Jianyu, Sahu, Anit Kumar, Yang, Zhouyi, Joshi, Gauri, Kar, Soummya · 2019 · 2019 Sixth Indian Control Conference (ICC)

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

Abstract

Decentralized stochastic gradient descent (SGD) is a promising approach to learn a machine learning model over a network of workers connected in an arbitrary topology. Although a densely-connected network topology can ensure faster convergence in terms of iterations, it incurs more communication time/delay per iteration, resulting in longer training time. In this paper, we propose a novel algorithm MATCHA to achieve a win-win in this error-runtime trade-off. MATCHA uses matching decomposition sampling of the base topology to parallelize inter-worker information exchange so as to significantly reduce communication delay. At the same time, the algorithm communicates more frequently over critical links such that it can maintain the same convergence rate as vanilla decentralized SGD. Experiments on a suite of datasets and deep neural networks validate the theoretical analysis and demonstrate the effectiveness of the proposed scheme as far as reducing communication delays is concerned.

Overview

Integrity signals

Registry

Crossref · 10.1109/icc47138.2019.9123209

Cites

24 of 24 references verified0 citation errors · 0 not checkable

Statistics

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

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, 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?

Citations

Cites

Show all 24 references

Cited by

See all 149

Metadata

Authors
Wang, J., Sahu, A. K., Yang, Z., Joshi, G., & Kar, S.
Affiliations
  • Carnegie Mellon University (US)
  • Robert Bosch (United States) (US)
Venue
2019 Sixth Indian Control Conference (ICC)
Publisher
IEEE
Published
2019-12
Pages
299-300
OpenAlex
W3038057116
Cited by
149
References
20
Citations by year
2026: 6 · 2025: 14 · 2024: 25 · 2023: 25 · 2022: 27 · 2021: 23 · 2020: 22 · 2019: 7
FWCI
7.56
Type
conference paper
Language
en
Open access
Locations
  • Indian Control Conference (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
Keywords
matcha, communication delay reduction, distributed learning, network topology, convergence rate

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: MATCHA: Speeding Up Decentralized SGD via Matching Decomposition Sampling. https://app.cochat.ai/papers/10.1109/icc47138.2019.9123209
The paper
Wang, J., Sahu, A. K., Yang, Z., Joshi, G., & Kar, S. (2019). MATCHA: Speeding Up Decentralized SGD via Matching Decomposition Sampling. 2019 Sixth Indian Control Conference (ICC). https://doi.org/10.1109/icc47138.2019.9123209

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.