mlsanityData to 7 Oct 2026

Communication-efficient Federated Learning with Single-Step Synthetic Features Compressor for Faster Convergence

arXiv 2302.13562 ↗First posted 27 Feb 2023cs.LG cs.AI cs.DCcited by 5

Not on the map. Why?

Abstract (arXiv)

Reducing communication overhead in federated learning (FL) is challenging but crucial for large-scale distributed privacy-preserving machine learning. While methods utilizing sparsification or others can largely lower the communication overhead, the convergence rate is also greatly compromised. In this paper, we propose a novel method, named single-step synthetic features compressor (3SFC), to achieve communication-efficient FL by directly constructing a tiny synthetic dataset based on raw gradients. Thus, 3SFC can achieve an extremely low compression rate when the constructed dataset contains only one data sample. Moreover, 3SFC's compressing phase utilizes a similarity-based objective function so that it can be optimized with just one step, thereby considerably improving its performance and robustness. In addition, to minimize the compressing error, error feedback (EF) is also incorporated into 3SFC. Experiments on multiple datasets and models suggest that 3SFC owns significantly better convergence rates compared to competing methods with lower compression rates (up to 0.02%). Furthermore, ablation studies and visualizations show that 3SFC can carry more information than competing methods for every communication round, further validating its effectiveness.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 27 of its 39 references that are in the map. First posted on arXiv 27 Feb 2023.

Builds on

27 of 39 references.

References · 27

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  4. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  5. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  6. 2020Scaling Laws for Neural Language Modelscited by 6,411
  7. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  8. 2019Advances and Open Problems in Federated Learningcited by 3,021
  9. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
  10. 2020Designing Network Design Spacescited by 954
  11. 2020Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimizationcited by 897
  12. 2019Towards Federated Learning at Scale: System Designcited by 826
15 more
  1. 2021Federated Learning on Non-IID Data Silos: An Experimental Studycited by 566
  2. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 561
  3. 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 471
  4. 2019Robust and Communication-Efficient Federated Learning from Non-IID Datacited by 415
  5. 2018Sparsified SGD with Memorycited by 373
  6. 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 306
  7. 2017Sparse Communication for Distributed Gradient Descentcited by 243
  8. 2017Gradient Sparsification for Communication-Efficient Distributed Optimizationcited by 199
  9. 2021FedKD: Communication Efficient Federated Learning via Knowledge Distillationcited by 185
  10. 2018Demystifying Parallel and Distributed Deep Learning: An In-Depth Concurrency Analysiscited by 154
  11. 2020Federated Learning via Synthetic Datacited by 53
  12. 2021Rethinking gradient sparsification as total error minimizationcited by 41
  13. 2020Communication-Efficient Federated Learning with Compensated Overlap-FedAvgcited by 31
  14. 2022FedSynth: Gradient Compression via Synthetic Data in Federated Learningcited by 30
  15. 2023Why Batch Normalization Damage Federated Learning on Non-IID Data?cited by 29

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 2; 2026: 1.

5 papers.