mlsanityData to 7 Oct 2026

How to Attain Communication-Efficient DNN Training? Convert, Compress, Correct

arXiv 2204.08211 ↗First posted 18 Apr 2022cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

This paper introduces CO3 -- an algorithm for communication-efficient federated Deep Neural Network (DNN) training. CO3 takes its name from three processing applied which reduce the communication load when transmitting the local DNN gradients from the remote users to the Parameter Server. Namely: (i) gradient quantization through floating-point conversion, (ii) lossless compression of the quantized gradient, and (iii) quantization error correction. We carefully design each of the steps above to assure good training performance under a constraint on the communication rate. In particular, in steps (i) and (ii), we adopt the assumption that DNN gradients are distributed according to a generalized normal distribution, which is validated numerically in the paper. For step (iii), we utilize an error feedback with memory decay mechanism to correct the quantization error introduced in step (i). We argue that the memory decay coefficient, similarly to the learning rate, can be optimally tuned to improve convergence. A rigorous convergence analysis of the proposed CO3 with SGD is provided. Moreover, with extensive simulations, we show that CO3 offers improved performance when compared with existing gradient compression schemes in the literature which employ sketching and non-uniform quantization of the local gradients.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 41 references that are in the map. First posted on arXiv 18 Apr 2022.

Builds on

25 of 41 references.

References · 25

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  2. 2016Densely Connected Convolutional Networkscited by 6,691
  3. 2016Identity Mappings in Deep Residual Networkscited by 1,960
  4. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
  5. 2017Learning Transferable Architectures for Scalable Image Recognitioncited by 1,097
  6. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 561
  7. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 463
  8. 2018Sparsified SGD with Memorycited by 373
  9. 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 306
  10. 2018The Convergence of Sparsified Gradient Methodscited by 228
  11. 2017Gradient Sparsification for Communication-Efficient Distributed Optimizationcited by 199
  12. 2019Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limitcited by 187
13 more
  1. 2020FetchSGD: Communication-Efficient Federated Learning with Sketchingcited by 178
  2. 2018cpSGD: Communication-efficient and differentially-private distributed SGDcited by 157
  3. 2016QSGD: Communication-Efficient SGD via Gradient Quantization and Encodingcited by 147
  4. 2018ATOMO: Communication-efficient Learning via Atomic Sparsificationcited by 135
  5. 2020A Rigorous Framework for the Mean Field Limit of Multilayer Neural Networkscited by 68
  6. 2019Understanding Top-k Sparsification in Distributed Deep Learningcited by 56
  7. 2020Modeling from Features: a Mean-field Framework for Over-parameterized Deep Neural Networkscited by 44
  8. 2021An Information-Theoretic Justification for Model Pruningcited by 23
  9. 2019Privacy for Free: Communication-Efficient Learning with Differential Privacy Using Sketchescited by 17
  10. 2019The Error-Feedback Framework: Better Rates for SGD with Delayed Gradients and Compressed Communicationcited by 12
  11. 2020Decentralized optimization over noisy, rate-constrained networks: Achieving consensus by communicating differencescited by 12
  12. 2021DNN gradient lossless compression: Can GenNorm be the answer?cited by 4
  13. 2022Lossy Gradient Compression: How Much Accuracy Can One Bit Buy?cited by 3

Built on by

Not cited yet.