mlsanityData to 7 Oct 2026

Lossy Gradient Compression: How Much Accuracy Can One Bit Buy?

arXiv 2202.02812 ↗First posted 6 Feb 2022cs.LG cs.IT math.ITcited by 3

Not on the map. Why?

Abstract (arXiv)

In federated learning (FL), a global model is trained at a Parameter Server (PS) by aggregating model updates obtained from multiple remote learners. Generally, the communication between the remote users and the PS is rate-limited, while the transmission from the PS to the remote users are unconstrained. The FL setting gives rise to the distributed learning scenario in which the updates from the remote learners have to be compressed so as to meet communication rate constraints in the uplink transmission toward the PS. For this problem, one wishes to compress the model updates so as to minimize the loss in accuracy resulting from the compression error. In this paper, we take a rate-distortion approach to address the compressor design problem for the distributed training of deep neural networks (DNNs). In particular, we define a measure of the compression performance under communication-rate constraints -- the per-bit accuracy -- which addresses the ultimate improvement of accuracy that a bit of communication brings to the centralized model. In order to maximize the per-bit accuracy, we consider modeling the DNN gradient updates at remote learners as a generalized normal distribution. Under this assumption on the DNN gradient distribution, we propose a class of distortion measures to aid the design of quantizers for the compression of the model updates. We argue that this family of distortion measures, which we refer to as "M-magnitude weighted L2" norm, captures the practitioner's intuition in the choice of gradient compressor. Numerical simulations are provided to validate the proposed approach for the CIFAR-10 dataset.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 15 of its 25 references that are in the map. First posted on arXiv 6 Feb 2022.

Builds on

15 of 25 references.

References · 15

  1. 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,531
  2. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
  3. 2017Deep Neural Networks as Gaussian Processescited by 617
  4. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 561
  5. 2018Sparsified SGD with Memorycited by 373
  6. 2018Gaussian Process Behaviour in Wide Deep Neural Networkscited by 314
  7. 2017TernGrad: Ternary Gradients to Reduce Communication in Distributed Deep Learningcited by 253
  8. 2018The Convergence of Sparsified Gradient Methodscited by 228
  9. 2018cpSGD: Communication-efficient and differentially-private distributed SGDcited by 157
  10. 2018ATOMO: Communication-efficient Learning via Atomic Sparsificationcited by 135
  11. 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 122
  12. 2018Communication Compression for Decentralized Trainingcited by 87
3 more
  1. 2019Privacy for Free: Communication-Efficient Learning with Differential Privacy Using Sketchescited by 17
  2. 2020Concentrated Differentially Private and Utility Preserving Federated Learningcited by 5
  3. 2021DNN gradient lossless compression: Can GenNorm be the answer?cited by 4

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 1.

3 papers.