Robust Federated Learning against both Data Heterogeneity and Poisoning Attack via Aggregation Optimization
Not on the map. Why?
Abstract (arXiv)
Non-IID data distribution across clients and poisoning attacks are two main challenges in real-world federated learning (FL) systems. While both of them have attracted great research interest with specific strategies developed, no known solution manages to address them in a unified framework. To universally overcome both challenges, we propose SmartFL, a generic approach that optimizes the server-side aggregation process with a small amount of proxy data collected by the service provider itself via a subspace training technique. Specifically, the aggregation weight of each participating client at each round is optimized using the server-collected proxy data, which is essentially the optimization of the global model in the convex hull spanned by client models. Since at each round, the number of tunable parameters optimized on the server side equals the number of participating clients (thus independent of the model size), we are able to train a global model with massive parameters using only a small amount of proxy data (e.g., around one hundred samples). With optimized aggregation, SmartFL ensures robustness against both heterogeneous and malicious clients, which is desirable in real-world FL where either or both problems may occur. We provide theoretical analyses of the convergence and generalization capacity for SmartFL. Empirically, SmartFL achieves state-of-the-art performance on both FL with non-IID data distribution and FL with malicious clients. The source code will be released.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 53 of its 76 references that are in the map. First posted on arXiv 10 Nov 2022.
Builds on
53 of 76 references.
References · 53
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
- 2019Advances and Open Problems in Federated Learningcited by 3,021
- 2018Federated Optimization in Heterogeneous Networkscited by 2,971
- 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
- 2018ShuffleNet V2: Practical Guidelines for Efficient CNN Architecture Designcited by 1,132
- 2018Federated Learning with Non-IID Datacited by 1,099
- 2020Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimizationcited by 897
- 2019Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classificationcited by 836
- 2021Model-Contrastive Federated Learningcited by 762
38 more
- 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
- 2020Ensemble Distillation for Robust Model Fusion in Federated Learningcited by 678
- 2020Ditto: Fair and Robust Federated Learning Through Personalizationcited by 665
- 2020The Future of Digital Health with Federated Learningcited by 625
- 2020Personalized Federated Learning with Moreau Envelopescited by 612
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
- 2021Federated Learning Based on Dynamic Regularizationcited by 555
- 2019Local Model Poisoning Attacks to Byzantine-Robust Federated Learningcited by 479
- 2019FedMD: Heterogenous Federated Learning via Model Distillationcited by 454
- 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 364
- 2020FLTrust: Byzantine-robust Federated Learning via Trust Bootstrappingcited by 330
- 2018Essentially No Barriers in Neural Network Energy Landscapecited by 328
- 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 324
- 2019Robust Aggregation for Federated Learningcited by 314
- 2018Gradient Descent Happens in a Tiny Subspacecited by 208
- 2020FedBE: Making Bayesian Model Ensemble Applicable to Federated Learningcited by 176
- 2019SCAFFOLD: Stochastic Controlled Averaging for Federated Learningcited by 174
- 2018Mitigating Sybils in Federated Learning Poisoningcited by 158
- 2018RSA: Byzantine-Robust Stochastic Aggregation Methods for Distributed Learning from Heterogeneous Datasetscited by 148
- 2020Survey of Personalization Techniques for Federated Learningcited by 144
- 2020Byzantine-Robust Learning on Heterogeneous Datasets via Bucketingcited by 125
- 2020Lower Bounds and Optimal Algorithms for Personalized Federated Learningcited by 122
- 2021Back to the Drawing Board: A Critical Evaluation of Poisoning Attacks on Production Federated Learningcited by 116
- 2021FedMix: Approximation of Mixup under Mean Augmented Federated Learningcited by 108
- 2021Parameterized Knowledge Transfer for Personalized Federated Learningcited by 108
- 2017On the convergence properties of a K-step averaging stochastic gradient descent algorithm for nonconvex optimizationcited by 91
- 2022Heterogeneous Ensemble Knowledge Transfer for Training Large Models in Federated Learningcited by 81
- 2019Explaining Landscape Connectivity of Low-cost Solutions for Multilayer Netscited by 63
- 2020XOR Mixup: Privacy-Preserving Data Augmentation for One-Shot Federated Learningcited by 58
- 2019Zeno++: Robust Fully Asynchronous SGDcited by 53
- 2021FedGEMS: Federated Learning of Larger Server Models via Selective Knowledge Fusioncited by 49
- 2020Inverse Distance Aggregation for Federated Learning with Non-IID Datacited by 44
- 2021Subspace Adversarial Trainingcited by 41
- 2019Attack-Resistant Federated Learning with Residual-based Reweightingcited by 40
- 2021Node Selection Toward Faster Convergence for Federated Learning on Non-IID Datacited by 39
- 2021Game of Gradients: Mitigating Irrelevant Clients in Federated Learningcited by 35
- 2021Efficient Neural Network Training via Forward and Backward Propagation Sparsificationcited by 30
- 2020Mix2FLD: Downlink Federated Learning After Uplink Federated Distillation With Two-Way Mixupcited by 29
50 most cited of 53 All 53 (JSON)
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 1.
3 papers.