mlsanityData to 7 Oct 2026

NET-FLEET: Achieving Linear Convergence Speedup for Fully Decentralized Federated Learning with Heterogeneous Data

arXiv 2208.08490 ↗First posted 17 Aug 2022cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

Federated learning (FL) has received a surge of interest in recent years thanks to its benefits in data privacy protection, efficient communication, and parallel data processing. Also, with appropriate algorithmic designs, one could achieve the desirable linear speedup for convergence effect in FL. However, most existing works on FL are limited to systems with i.i.d. data and centralized parameter servers and results on decentralized FL with heterogeneous datasets remains limited. Moreover, whether or not the linear speedup for convergence is achievable under fully decentralized FL with data heterogeneity remains an open question. In this paper, we address these challenges by proposing a new algorithm, called NET-FLEET, for fully decentralized FL systems with data heterogeneity. The key idea of our algorithm is to enhance the local update scheme in FL (originally intended for communication efficiency) by incorporating a recursive gradient correction technique to handle heterogeneous datasets. We show that, under appropriate parameter settings, the proposed NET-FLEET algorithm achieves a linear speedup for convergence. We further conduct extensive numerical experiments to evaluate the performance of the proposed NET-FLEET algorithm and verify our theoretical findings.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 27 of its 43 references that are in the map. First posted on arXiv 17 Aug 2022.

Builds on

27 of 43 references.

References · 27

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  3. 2019Advances and Open Problems in Federated Learningcited by 3,021
  4. 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,531
  5. 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 716
  6. 2018Local SGD Converges Fast and Communicates Littlecited by 595
  7. 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 496
  8. 2019Federated Machine Learning: Concept and Applicationscited by 409
  9. 2018Adaptive Federated Learning in Resource Constrained Edge Computing Systemscited by 408
  10. 2020FLTrust: Byzantine-robust Federated Learning via Trust Bootstrappingcited by 330
  11. 2018SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimatorcited by 283
  12. 2018Parallel Restarted SGD with Faster Convergence and Less Communication: Demystifying Why Model Averaging Works for Deep Learningcited by 277
15 more
  1. 2018Don't Use Large Mini-Batches, Use Local SGDcited by 201
  2. 2021Achieving Linear Speedup with Partial Worker Participation in Non-IID Federated Learningcited by 192
  3. 2019On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed Non-Convex Optimizationcited by 178
  4. 2013On the Convergence of Decentralized Gradient Descentcited by 158
  5. 2019On the Convergence of Local Descent Methods in Federated Learningcited by 150
  6. 2018Distributed Stochastic Gradient Tracking Methodscited by 106
  7. 2019Reliable Federated Learning for Mobile Networkscited by 92
  8. 2019Variance Reduced Local SGD with Lower Communication Complexitycited by 80
  9. 2020An improved convergence analysis for decentralized online stochastic non-convex optimizationcited by 53
  10. 2016On Nonconvex Decentralized Gradient Descentcited by 42
  11. 2021Anarchic Federated Learningcited by 42
  12. 2019Communication-Efficient Local Decentralized SGD Methodscited by 21
  13. 2020Periodic Stochastic Gradient Descent with Momentum for Decentralized Trainingcited by 14
  14. 2019The Error-Feedback Framework: Better Rates for SGD with Delayed Gradients and Compressed Communicationcited by 12
  15. 2021CFedAvg: Achieving Efficient Communication and Fast Convergence in Non-IID Federated Learningcited by 6

Built on by

Cited by year (2026 to 7 Oct)

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

12 papers.