CoChat

Lazily Aggregated Quantized Gradient Innovation for Communication-Efficient Federated Learning

Sun, Jun, Chen, Tianyi, Giannakis, Georgios B., Yang, Qinmin, Yang, Zaiyue · 2022 · IEEE Transactions on Pattern Analysis and Machine Intelligence

The DOI matches its Crossref record, with a small difference in title or year; 38 of the 39 references it cites were found in a registry or an index.

Abstract

This paper focuses on communication-efficient federated learning problem, and develops a novel distributed quantized gradient approach, which is characterized by adaptive communications of the quantized gradients. Specifically, the federated learning builds upon the server-worker infrastructure, where the workers calculate local gradients and upload them to the server; then the server obtain the global gradient by aggregating all the local gradients and utilizes it to update the model parameter. The key idea to save communications from the worker to the server is to quantize gradients as well as skip less informative quantized gradient communications by reusing previous gradients. Quantizing and skipping result in 'lazy' worker-server communications, which justifies the term Lazily Aggregated Quantized (LAQ) gradient. Theoretically, the LAQ algorithm achieves the same linear convergence as the gradient descent in the strongly convex case, while effecting major savings in the communication in terms of transmitted bits and communication rounds. Empirically, extensive experiments using realistic data corroborate a significant communication reduction compared with state-of-the-art gradient- and stochastic gradient-based algorithms.

Overview

Integrity signals

Registry

Crossref · 10.1109/tpami.2020.3033286

Cites

38 of 38 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

Show all 38 references

Research works printed but not linked: 3

  1. McMahan, Communication-efficient learning of deep networks from decentralized data, 1273
  2. 10.5555/3294771.3294915 · doi:10.5555/3294771.3294915
  3. LeCun, 2010, MNIST handwritten digit database

Cited by

See all 134

Metadata

Authors
Sun, J., Chen, T., Giannakis, G. B., Yang, Q., & Yang, Z.
Affiliations
  • State Key Laboratory of Industrial Control Technology (CN)
  • Rensselaer Polytechnic Institute (US)
  • University of Minnesota (US)
  • Southern University of Science and Technology (CN)
Venue
IEEE Transactions on Pattern Analysis and Machine Intelligence
Published
2022-04-01
Volume
44
Issue
4
Pages
2031-2044
ISSN
  • 0162-8828 (ISSN-L)
  • 2160-9292
  • 1939-3539
OpenAlex
W3093828967
Cited by
102
References
39
Citations by year
2026: 10 · 2025: 16 · 2024: 28 · 2023: 26 · 2022: 13
FWCI
4.71
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Pattern Analysis and Machine Intelligence (publishedVersion)
  • PubMed (publishedVersion)
Funders
  • National Natural Science Foundation of China (61873118, 61751205)
  • Shenzhen Committee on Science and Innovations (GJHZ20180411143603361)
  • Guangdong Science and Technology Department (2018A050506003)
  • China Scholarship Council
  • Key-Area Research and Development Program of Guangdong Province (2018B010107002)
  • National Science Foundation (1901134)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
Keywords
federated learning, communication efficiency, gradient quantization, adaptive communication, linear convergence, strongly convex optimization, distributed optimization

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.