MANDERA: Malicious Node Detection in Federated Learning via Ranking
Not on the map. Why?
Abstract (arXiv)
Byzantine attacks hinder the deployment of federated learning algorithms. Although we know that the benign gradients and Byzantine attacked gradients are distributed differently, to detect the malicious gradients is challenging due to (1) the gradient is high-dimensional and each dimension has its unique distribution and (2) the benign gradients and the attacked gradients are always mixed (two-sample test methods cannot apply directly). To address the above, for the first time, we propose MANDERA which is theoretically guaranteed to efficiently detect all malicious gradients under Byzantine attacks with no prior knowledge or history about the number of attacked nodes. More specifically, we transfer the original updating gradient space into a ranking matrix. By such an operation, the scales of different dimensions of the gradients in the ranking space become identical. The high-dimensional benign gradients and the malicious gradients can be easily separated. The effectiveness of MANDERA is further confirmed by experimentation on four Byzantine attack implementations (Gaussian, Zero Gradient, Sign Flipping, Shifted Mean), comparing with state-of-the-art defenses. The experiments cover both IID and Non-IID datasets.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 50 references that are in the map. First posted on arXiv 22 Oct 2021.
Builds on
22 of 50 references.
References · 22
- 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
- 2019Advances and Open Problems in Federated Learningcited by 3,046
- 2018How To Backdoor Federated Learningcited by 765
- 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
- 2020Data Poisoning Attacks Against Federated Learning Systemscited by 275
- 2020Byzantine-Resilient Secure Federated Learningcited by 93
- 2020Learning to Detect Malicious Clients for Robust Federated Learningcited by 88
10 more
- 2019Federated Variance-Reduced Stochastic Gradient Descent with Robustness to Byzantine Attackscited by 79
- 2013Divide and Conquer Kernel Ridge Regression: A Distributed Algorithm with Minimax Optimal Ratescited by 65
- 2021Provably Secure Federated Learning against Malicious Clientscited by 63
- 2019Cold Case: The Lost MNIST Digitscited by 62
- 2017Distributed Statistical Machine Learning in Adversarial Settings: Byzantine Gradient Descentcited by 59
- 2019Zeno++: Robust Fully Asynchronous SGDcited by 53
- 2018First-order Newton-type Estimator for Distributed Estimation and Inferencecited by 16
- 2019Heterogeneity-aware and communication-efficient distributed statistical inferencecited by 15
- 2017Distributed inference for quantile regression processescited by 11
- 2016Divide and Conquer in Non-standard Problems and the Super-efficiency Phenomenoncited by 5
Built on by
Not cited yet.