CoChat

rTop-k: A Statistical Estimation Approach to Distributed SGD

Barnes, Leighton Pate, Inan, Huseyin A., Isik, Berivan, Ozgur, Ayfer · 2020 · IEEE Journal on Selected Areas in Information Theory

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

Abstract

The large communication cost for exchanging gradients between different nodes significantly limits the scalability of distributed training for large-scale learning models. Motivated by this observation, there has been significant recent interest in techniques that reduce the communication cost of distributed Stochastic Gradient Descent (SGD), with gradient sparsification techniques such as top-k and random-k shown to be particularly effective. The same observation has also motivated a separate line of work in distributed statistical estimation theory focusing on the impact of communication constraints on the estimation efficiency of different statistical models. The primary goal of this paper is to connect these two research lines and demonstrate how statistical estimation models and their analysis can lead to new insights in the design of communication-efficient training techniques. We propose a simple statistical estimation model for the stochastic gradients which captures the sparsity and skewness of their distribution. The statistically optimal communication scheme arising from the analysis of this model leads to a new sparsification technique for SGD, which concatenates random-k and top-k, considered separately in the prior literature. We show through extensive experiments on both image and language domains with CIFAR-10, ImageNet, and Penn Treebank datasets that the concatenated application of these two sparsification methods consistently and significantly outperforms either method applied alone.

Overview

Integrity signals

Registry

Crossref · 10.1109/jsait.2020.3042094

Cites

51 of 51 references verified0 citation errors · 0 not checkable

Statistics

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

Verification

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?

Citations

Cites

Research works printed but not linked: 2

  1. diakonikolas, 2017, Communication-efficient distributed learning of discrete probability distributions, Proc Adv Neural Inf Process Syst, 6394
  2. niu, 2011, Hogwild: A lock-free approach to parallelizing stochastic gradient, Proc NIPS, 24, 693

Cited by

See all 45

Metadata

Authors
Barnes, L. P., Inan, H. A., Isik, B., & Ozgur, A.
Affiliations
Stanford University (US)
Venue
IEEE Journal on Selected Areas in Information Theory
Published
2020-11
Volume
1
Issue
3
Pages
897-907
ISSN
2641-8770 (ISSN-L)
OpenAlex
W3107557773
Cited by
44
References
57
Citations by year
2026: 3 · 2025: 5 · 2024: 10 · 2023: 14 · 2022: 6 · 2021: 6
FWCI
2.55
Type
journal article
Language
en
Open access
closed
Locations
IEEE Journal on Selected Areas in Information Theory (publishedVersion)
Funders
  • NSF (CCF-1704624)
  • Google Faculty Research Award
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
distributed stochastic gradient descent, communication efficiency, gradient sparsification, top-k sparsification

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

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.