FedFa: A Fully Asynchronous Training Paradigm for Federated Learning
Haotian Xu, Zhaorui Zhang, Sheng Di, Benben Liu, Khalid Ayed Alharthi,, Jiannong Cao

TL;DR
FedFa introduces a fully asynchronous federated learning paradigm that guarantees convergence, eliminates waiting times, and significantly accelerates training speed while maintaining high accuracy across diverse data distributions.
Contribution
The paper proposes FedFa, a novel fully asynchronous training method for federated learning that guarantees convergence and reduces training time by eliminating synchronization delays.
Findings
FedFa achieves up to 6x speedup over synchronous methods.
FedFa maintains high accuracy in IID and Non-IID data scenarios.
Theoretical proof confirms convergence rate of FedFa.
Abstract
Federated learning has been identified as an efficient decentralized training paradigm for scaling the machine learning model training on a large number of devices while guaranteeing the data privacy of the trainers. FedAvg has become a foundational parameter update strategy for federated learning, which has been promising to eliminate the effect of the heterogeneous data across clients and guarantee convergence. However, the synchronization parameter update barriers for each communication round during the training significant time on waiting, slowing down the training procedure. Therefore, recent state-of-the-art solutions propose using semi-asynchronous approaches to mitigate the waiting time cost with guaranteed convergence. Nevertheless, emerging semi-asynchronous approaches are unable to eliminate the waiting time completely. We propose a full asynchronous training paradigm,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBig Data and Digital Economy
