CoChat

Qsparse-Local-SGD: Distributed SGD With Quantization, Sparsification, and Local Computations

Open access
Basu, Debraj, Data, Deepesh, Karakus, Can, Diggavi, Suhas N. · 2020 · IEEE Journal on Selected Areas in Information Theory

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

Abstract

Communication bottleneck has been identified as a significant issue in distributed optimization of large-scale learning models. Recently, several approaches to mitigate this problem have been proposed, including different forms of gradient compression or computing local models and mixing them iteratively. In this paper, we propose Qsparse-local-SGD algorithm, which combines aggressive sparsification with quantization and local computation along with error compensation, by keeping track of the difference between the true and compressed gradients. We propose both synchronous and asynchronous implementations of Qsparse-local-SGD. We analyze convergence for Qsparse-local-SGD in the distributed setting for smooth non-convex and convex objective functions. We demonstrate that Qsparse-local-SGD converges at the same rate as vanilla distributed SGD for many important classes of sparsifiers and quantizers. We use Qsparse-local-SGD to train ResNet-50 on ImageNet and show that it results in significant savings over the state-of-the-art, in the number of bits transmitted to reach target accuracy.

Overview

Integrity signals

Registry

Crossref · 10.1109/jsait.2020.2985917

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

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 51 references

Research works printed but not linked: 2

  1. tieleman, 2012, Lecture 6.5-RMSprop: Divide the gradient by a running average of its recent magnitude, COURSERA Neural Netw Mach Learn, 4, 26
  2. basu, 2019, QSparse-local-SGD: Distributed SGD with quantization, sparsification and local computations, Proc Neural Inf Process Syst, 14668

Cited by

See all 256

Metadata

Authors
Basu, D., Data, D., Karakus, C., & Diggavi, S. N.
Affiliations
  • Adobe Systems (United States) (US)
  • University of California, Los Angeles (US)
  • Amazon (United States) (US)
Venue
IEEE Journal on Selected Areas in Information Theory
Published
2020-05
Volume
1
Issue
1
Pages
217-226
ISSN
2641-8770 (ISSN-L)
OpenAlex
W2948092338
Cited by
256
References
56
Citations by year
2026: 10 · 2025: 26 · 2024: 67 · 2023: 67 · 2022: 36 · 2021: 35 · 2020: 15
FWCI
15.03
Type
journal article
Language
en
Open access
Locations
  • IEEE Journal on Selected Areas in Information Theory (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
  • neural information processing systems
Funders
  • NSF (1514531)
  • UC-NL (LFR-18-548554)
  • Army Research Laboratory under Cooperative Agreement (W911NF-17-2-0196)
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
gradient quantization, gradient sparsification, local computation, error compensation, communication efficiency, asynchronous SGD, convergence analysis, non-convex optimization, convex optimization, ImageNet

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: Qsparse-Local-SGD: Distributed SGD With Quantization, Sparsification, and Local Computations. https://app.cochat.ai/papers/10.1109/jsait.2020.2985917
The paper
Basu, D., Data, D., Karakus, C., & Diggavi, S. N. (2020). Qsparse-Local-SGD: Distributed SGD With Quantization, Sparsification, and Local Computations. IEEE Journal on Selected Areas in Information Theory. https://doi.org/10.1109/jsait.2020.2985917

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.