Asynchronous Byzantine Federated Learning
Not on the map. Why?
Abstract (arXiv)
Federated learning (FL) enables a set of geographically distributed clients to collectively train a model through a server. Classically, the training process is synchronous, but can be made asynchronous to maintain its speed in presence of slow clients and in heterogeneous networks. The vast majority of Byzantine fault-tolerant FL systems however rely on a synchronous training process. Our solution is one of the first Byzantine-resilient and asynchronous FL algorithms that does not require an auxiliary server dataset and is not delayed by stragglers, which are shortcomings of previous works. Intuitively, the server in our solution waits to receive a minimum number of updates from clients on its latest model to safely update it, and is later able to safely leverage the updates that late clients might send. We compare the performance of our solution with state-of-the-art algorithms on both image and text datasets under gradient inversion, perturbation, and backdoor attacks. Our results indicate that our solution trains a model faster than previous synchronous FL solution, and maintains a higher accuracy, up to 1.54x and up to 1.75x for perturbation and gradient inversion attacks respectively, in the presence of Byzantine clients than previous asynchronous FL solutions.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 26 of its 56 references that are in the map. First posted on arXiv 3 Jun 2024.
Builds on
26 of 56 references.
References · 26
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2018Federated Optimization in Heterogeneous Networkscited by 2,971
- 2017BadNets: Identifying Vulnerabilities in the Machine Learning Model Supply Chaincited by 1,052
- 2019Towards Federated Learning at Scale: System Designcited by 826
- 2021Model-Contrastive Federated Learningcited by 762
- 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
- 2019Local Model Poisoning Attacks to Byzantine-Robust Federated Learningcited by 479
- 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 471
- 2018Client Selection for Federated Learning with Heterogeneous Resources in Mobile Edgecited by 347
- 2020FLTrust: Byzantine-robust Federated Learning via Trust Bootstrappingcited by 330
- 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 324
14 more
- 2020Attack of the Tails: Yes, You Really Can Backdoor Federated Learningcited by 307
- 2019Asynchronous Federated Optimizationcited by 264
- 2021Federated Learning with Buffered Asynchronous Aggregationcited by 188
- 2020TiFL: A Tier-based Federated Learning Systemcited by 95
- 2018Generalized Byzantine-tolerant SGDcited by 94
- 2019SAFA: a Semi-Asynchronous Protocol for Fast Federated Learning with Low Overheadcited by 82
- 2018Byzantine Stochastic Gradient Descentcited by 81
- 2018DRACO: Byzantine-resilient Distributed Training via Redundant Gradientscited by 74
- 2019Zeno++: Robust Fully Asynchronous SGDcited by 53
- 2021FedAdapt: Adaptive Offloading for IoT Devices in Federated Learningcited by 26
- 2021EIFFeL: Ensuring Integrity for Federated Learningcited by 26
- 2020Asynchronous Federated Learning with Reduced Number of Rounds and with Differential Privacy from Less Aggregated Gaussian Noisecited by 21
- 2021Stragglers Are Not Disaster: A Hybrid Federated Learning Algorithm with Delayed Gradientscited by 13
- 2021SAFELearning: Enable Backdoor Detectability In Federated Learning With Secure Aggregationcited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.