mlsanityData to 14 Oct 2026

Slashing Communication Traffic in Federated Learning by Transmitting Clustered Model Updates

arXiv 2105.04153 ↗First posted 10 May 2021cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

Federated Learning (FL) is an emerging decentralized learning framework through which multiple clients can collaboratively train a learning model. However, a major obstacle that impedes the wide deployment of FL lies in massive communication traffic. To train high dimensional machine learning models (such as CNN models), heavy communication traffic can be incurred by exchanging model updates via the Internet between clients and the parameter server (PS), implying that the network resource can be easily exhausted. Compressing model updates is an effective way to reduce the traffic amount. However, a flexible unbiased compression algorithm applicable for both uplink and downlink compression in FL is still absent from existing works. In this work, we devise the Model Update Compression by Soft Clustering (MUCSC) algorithm to compress model updates transmitted between clients and the PS. In MUCSC, it is only necessary to transmit cluster centroids and the cluster ID of each model update. Moreover, we prove that: 1) The compressed model updates are unbiased estimation of their original values so that the convergence rate by transmitting compressed model updates is unchanged; 2) MUCSC can guarantee that the influence of the compression error on the model accuracy is minimized. Then, we further propose the boosted MUCSC (B-MUCSC) algorithm, a biased compression algorithm that can achieve an extremely high compression rate by grouping insignificant model updates into a super cluster. B-MUCSC is suitable for scenarios with very scarce network resource. Ultimately, we conduct extensive experiments with the CIFAR-10 and FEMNIST datasets to demonstrate that our algorithms can not only substantially reduce the volume of communication traffic in FL, but also improve the training efficiency in practical networks.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 30 of its 50 references that are in the map. First posted on arXiv 10 May 2021.

Builds on

30 of 50 references.

References · 30

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  2. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,475
  3. 2019On the Convergence of FedAvg on Non-IID Datacited by 1,229
  4. 2014Striving for Simplicity: The All Convolutional Netcited by 990
  5. 2019Towards Federated Learning at Scale: System Designcited by 832
  6. 2018LEAF: A Benchmark for Federated Settingscited by 792
  7. 2018Federated Learning for Mobile Keyboard Predictioncited by 572
  8. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 571
  9. 2016Federated Optimization: Distributed Machine Learning for On-Device Intelligencecited by 564
  10. 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 478
  11. 2019Robust and Communication-Efficient Federated Learning from Non-IID Datacited by 419
  12. 2018Adaptive Federated Learning in Resource Constrained Edge Computing Systemscited by 409
18 more
  1. 2019Federated Learning in Mobile Edge Networks: A Comprehensive Surveycited by 408
  2. 2018Sparsified SGD with Memorycited by 376
  3. 2018Client Selection for Federated Learning with Heterogeneous Resources in Mobile Edgecited by 352
  4. 2018Parallel Restarted SGD with Faster Convergence and Less Communication: Demystifying Why Model Averaging Works for Deep Learningcited by 278
  5. 2017TernGrad: Ternary Gradients to Reduce Communication in Distributed Deep Learningcited by 256
  6. 2017Sparse Communication for Distributed Gradient Descentcited by 249
  7. 2018The Convergence of Sparsified Gradient Methodscited by 229
  8. 2019Client-Edge-Cloud Hierarchical Federated Learningcited by 202
  9. 2017Gradient Sparsification for Communication-Efficient Distributed Optimizationcited by 201
  10. 2016Distributed Mean Estimation with Limited Communicationcited by 136
  11. 2018ATOMO: Communication-efficient Learning via Atomic Sparsificationcited by 136
  12. 2019Federated Learning over Wireless Networks: Convergence Analysis and Resource Allocationcited by 94
  13. 2020Adaptive Gradient Sparsification for Efficient Federated Learning: An Online Learning Approachcited by 81
  14. 2016Randomized Distributed Mean Estimation: Accuracy vs Communicationcited by 39
  15. 2018Federated Learning for Ultra-Reliable Low-Latency V2V Communicationscited by 30
  16. 2013Millimeter Wave Channel Modeling and Cellular Capacity Evaluationcited by 29
  17. 2019Layer-wise Adaptive Gradient Sparsification for Distributed Deep Learning with Convergence Guaranteescited by 8
  18. 2018Federated AI for building AI Solutions across Multiple Agenciescited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 3; 2023: 2; 2024: 1; 2025: 2; 2026: 1.

10 papers.