M22: A Communication-Efficient Algorithm for Federated Learning Inspired by Rate-Distortion
Not on the map. Why?
Abstract (arXiv)
In federated learning (FL), the communication constraint between the remote learners and the Parameter Server (PS) is a crucial bottleneck. For this reason, model updates must be compressed so as to minimize the loss in accuracy resulting from the communication constraint. This paper proposes ``emphbf M-magnitude weighted Lbf 2 distortion + bf 2 degrees of freedom'' (M22) algorithm, a rate-distortion inspired approach to gradient compression for federated training of deep neural networks (DNNs). In particular, we propose a family of distortion measures between the original gradient and the reconstruction we referred to as ``M-magnitude weighted L2'' distortion, and we assume that gradient updates follow an i.i.d. distribution -- generalized normal or Weibull, which have two degrees of freedom. In both the distortion measure and the gradient, there is one free parameter for each that can be fitted as a function of the iteration number. Given a choice of gradient distribution and distortion measure, we design the quantizer minimizing the expected distortion in gradient reconstruction. To measure the gradient compression performance under a communication constraint, we define the per-bit accuracy as the optimal improvement in accuracy that one bit of communication brings to the centralized model over the training period. Using this performance measure, we systematically benchmark the choice of gradient distribution and distortion measure. We provide substantial insights on the role of these choices and argue that significant performance improvements can be attained using such a rate-distortion inspired compressor.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 29 of its 51 references that are in the map. First posted on arXiv 23 Jan 2023.
Builds on
29 of 51 references.
References · 29
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,531
- 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
- 2017Deep Neural Networks as Gaussian Processescited by 617
- 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 561
- 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 471
- 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 463
- 2019Robust and Communication-Efficient Federated Learning from Non-IID Datacited by 415
- 2018Sparsified SGD with Memorycited by 373
- 2018Gaussian Process Behaviour in Wide Deep Neural Networkscited by 314
- 2017TernGrad: Ternary Gradients to Reduce Communication in Distributed Deep Learningcited by 253
17 more
- 2017Sparse Communication for Distributed Gradient Descentcited by 243
- 2018The Convergence of Sparsified Gradient Methodscited by 228
- 2020FetchSGD: Communication-Efficient Federated Learning with Sketchingcited by 178
- 2018Expanding the Reach of Federated Learning by Reducing Client Resource Requirementscited by 162
- 2018cpSGD: Communication-efficient and differentially-private distributed SGDcited by 157
- 2018ATOMO: Communication-efficient Learning via Atomic Sparsificationcited by 135
- 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 122
- 2019Approximate Inference Turns Deep Networks into Gaussian Processescited by 89
- 2018Communication Compression for Decentralized Trainingcited by 87
- 2019Communication-efficient distributed SGD with Sketchingcited by 81
- 2020A Rigorous Framework for the Mean Field Limit of Multilayer Neural Networkscited by 68
- 2021An Information-Theoretic Justification for Model Pruningcited by 23
- 2018Variance-based Gradient Compression for Efficient Distributed Deep Learningcited by 21
- 2019Privacy for Free: Communication-Efficient Learning with Differential Privacy Using Sketchescited by 17
- 2020Decentralized optimization over noisy, rate-constrained networks: Achieving consensus by communicating differencescited by 12
- 2020Concentrated Differentially Private and Utility Preserving Federated Learningcited by 5
- 2021DNN gradient lossless compression: Can GenNorm be the answer?cited by 4
Built on by
Citing papers per year: 2024: 1.
1 paper.