Robust Federated Learning under Adversarial Attacks via Loss-Based Client Clustering
Not on the map. Why?
Abstract (arXiv)
Federated Learning (FL) enables collaborative model training across multiple clients without sharing private data. We consider FL scenarios wherein FL clients are subject to adversarial (Byzantine) attacks, while the FL server is trusted (honest) and has a trustworthy side dataset. This may correspond to, e.g., cases where the server possesses trusted data prior to federation, or to the presence of a trusted client that temporarily assumes the server role. Our approach requires only two honest participants, i.e., the server and one client, to function effectively, without prior knowledge of the number of malicious clients. Theoretical analysis demonstrates bounded optimality gaps even under strong Byzantine attacks. Experimental results show that our algorithm significantly outperforms standard and robust FL baselines such as Mean, Trimmed Mean, Median, Krum, and Multi-Krum under various attack strategies including label flipping, sign flipping, and Gaussian noise addition across MNIST, FMNIST, and CIFAR-10 benchmarks using the Flower framework.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 17 of its 24 references that are in the map. First posted on arXiv 18 Aug 2025.
Builds on
17 of 24 references.
References · 17
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,538
- 2020Adaptive Federated Optimizationcited by 1,046
- 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 711
- 2019Local Model Poisoning Attacks to Byzantine-Robust Federated Learningcited by 493
- 2020FLTrust: Byzantine-robust Federated Learning via Trust Bootstrappingcited by 346
- 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 329
- 2019A Little Is Enough: Circumventing Defenses For Distributed Learningcited by 288
- 2019Fall of Empires: Breaking Byzantine-tolerant SGD by Inner Product Manipulationcited by 141
- 2020Multi-Task Federated Learning for Personalised Deep Neural Networks in Edge Computingcited by 52
- 2021FedCor: Correlation-Based Active Client Selection Strategy for Heterogeneous Federated Learningcited by 43
5 more
- 2023An Experimental Study of Byzantine-Robust Aggregation Schemes in Federated Learningcited by 32
- 2024Byzantine-Robust Federated Learning: Impact of Client Subsampling and Local Updatescited by 14
- 2023Federated Learning with Extremely Noisy Clients via Negative Distillationcited by 12
- 2021Byzantine-robust Federated Learning through Spatial-temporal Analysis of Local Model Updatescited by 8
- 2016Adaptive Newton Method for Empirical Risk Minimization to Statistical Accuracycited by 5
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.