mlsanityData to 7 Oct 2026

Asynchronous Federated Learning with Bidirectional Quantized Communications and Buffered Aggregation

arXiv 2308.00263 ↗First posted 1 Aug 2023cs.LG eess.SP math.OCcited by 10

Not on the map. Why?

Abstract (arXiv)

Asynchronous Federated Learning with Buffered Aggregation (FedBuff) is a state-of-the-art algorithm known for its efficiency and high scalability. However, it has a high communication cost, which has not been examined with quantized communications. To tackle this problem, we present a new algorithm (QAFeL), with a quantization scheme that establishes a shared "hidden" state between the server and clients to avoid the error propagation caused by direct quantization. This approach allows for high precision while significantly reducing the data transmitted during client-server interactions. We provide theoretical convergence guarantees for QAFeL and corroborate our analysis with experiments on a standard benchmark.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 31 of its 44 references that are in the map. First posted on arXiv 1 Aug 2023.

Builds on

31 of 44 references.

References · 31

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  4. 2014Deep Learning Face Attributes in the Wildcited by 3,679
  5. 2018Federated Optimization in Heterogeneous Networkscited by 2,971
  6. 2018Group Normalizationcited by 1,514
  7. 2019On the Convergence of FedAvg on Non-IID Datacited by 1,220
  8. 2020Adaptive Federated Optimizationcited by 1,036
  9. 2018LEAF: A Benchmark for Federated Settingscited by 780
  10. 2020Inverting Gradients -- How easy is it to break privacy in federated learning?cited by 707
  11. 2018Local SGD Converges Fast and Communicates Littlecited by 595
  12. 2018Exploiting Unintended Feature Leakage in Collaborative Learningcited by 509
19 more
  1. 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 306
  2. 2019The Non-IID Data Quagmire of Decentralized Machine Learningcited by 303
  3. 2019Asynchronous Federated Optimizationcited by 264
  4. 2019Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communicationcited by 218
  5. 2016Practical Secure Aggregation for Federated Learning on User-Held Datacited by 178
  6. 2019On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed Non-Convex Optimizationcited by 178
  7. 2021Practical and Private (Deep) Learning without Sampling or Shufflingcited by 169
  8. 2021EF21: A New, Simpler, Theoretically Better, and Practically Faster Error Feedbackcited by 131
  9. 2021Asynchronous Federated Learning on Heterogeneous Devices: A Surveycited by 93
  10. 2021Papaya: Practical, Private, and Scalable Federated Learningcited by 89
  11. 2022Sharper Convergence Guarantees for Asynchronous SGD for Distributed and Federated Learningcited by 76
  12. 2015Perturbed Iterate Analysis for Asynchronous Stochastic Optimizationcited by 67
  13. 2020Federated Learning With Quantized Global Model Updatescited by 54
  14. 2020A Better Alternative to Error Feedback for Communication-Efficient Distributed Learningcited by 42
  15. 2020Optimal Gradient Compression for Distributed and Federated Learningcited by 37
  16. 2018Improved asynchronous parallel optimization analysis for stochastic incremental methodscited by 30
  17. 2022EF21-P and Friends: Improved Theoretical Communication Complexity for Distributed Optimization with Bidirectional Compressioncited by 28
  18. 2021Critical Parameters for Scalable Distributed Learning with Large Batches and Asynchronous Updatescited by 16
  19. 2023Gossiped and Quantized Online Multi-Kernel Learningcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 6; 2025: 3; 2026: 1.

10 papers.