Robust Quantity-Aware Aggregation for Federated Learning
Not on the map. Why?
Abstract (arXiv)
Federated learning (FL) enables multiple clients to collaboratively train models without sharing their local data, and becomes an important privacy-preserving machine learning framework. However, classical FL faces serious security and robustness problem, e.g., malicious clients can poison model updates and at the same time claim large quantities to amplify the impact of their model updates in the model aggregation. Existing defense methods for FL, while all handling malicious model updates, either treat all quantities benign or simply ignore/truncate the quantities of all clients. The former is vulnerable to quantity-enhanced attack, while the latter leads to sub-optimal performance since the local data on different clients is usually in significantly different sizes. In this paper, we propose a robust quantity-aware aggregation algorithm for federated learning, called FedRA, to perform the aggregation with awareness of local data quantities while being able to defend against quantity-enhanced attacks. More specifically, we propose a method to filter malicious clients by jointly considering the uploaded model updates and data quantities from different clients, and performing quantity-aware weighted averaging on model updates from remaining clients. Moreover, as the number of malicious clients participating in the federated learning may dynamically change in different rounds, we also propose a malicious client number estimator to predict how many suspicious clients should be filtered in each round. Experiments on four public datasets demonstrate the effectiveness of our FedRA method in defending FL against quantity-enhanced attacks.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 27 of its 48 references that are in the map. First posted on arXiv 22 May 2022.
Builds on
27 of 48 references.
References · 27
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2018Federated Optimization in Heterogeneous Networkscited by 2,987
- 2020Adaptive Federated Optimizationcited by 1,046
- 2016An overview of gradient descent optimization algorithmscited by 1,033
- 2018How To Backdoor Federated Learningcited by 765
- 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 711
- 2017Federated Multi-Task Learningcited by 672
- 2020The Future of Digital Health with Federated Learningcited by 633
- 2018Federated Learning for Mobile Keyboard Predictioncited by 572
- 2019Local Model Poisoning Attacks to Byzantine-Robust Federated Learningcited by 493
- 2018Analyzing Federated Learning through an Adversarial Lenscited by 351
- 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 329
15 more
- 2019Robust Aggregation for Federated Learningcited by 317
- 2020Attack of the Tails: Yes, You Really Can Backdoor Federated Learningcited by 309
- 2019A Little Is Enough: Circumventing Defenses For Distributed Learningcited by 288
- 2019Can You Really Backdoor Federated Learning?cited by 255
- 2018Applied Federated Learning: Improving Google Keyboard Query Suggestionscited by 204
- 2021Federated Learning for Smart Healthcare: A Surveycited by 184
- 2019Federated Learning for Emoji Prediction in a Mobile Keyboardcited by 118
- 2016Range Loss for Deep Face Recognition with Long-tailcited by 111
- 2022Retrieval Augmented Classification for Long-Tail Visual Recognitioncited by 106
- 2021CRFL: Certifiably Robust Federated Learning against Backdoor Attackscited by 91
- 2019Federated Learning Of Out-Of-Vocabulary Wordscited by 51
- 2020ESAM: Discriminative Domain Adaptation with Non-Displayed Items to Improve Long-Tail Performancecited by 30
- 2021Efficient-FedRec: Efficient Federated Learning Framework for Privacy-Preserving News Recommendationcited by 21
- 2020Towards Federated Learning With Byzantine-Robust Client Weightingcited by 6
- 2021Uni-FedRec: A Unified Privacy-Preserving News Recommendation Framework for Model Training and Online Servingcited by 6
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.