mlsanityData to 7 Oct 2026

SureFED: Robust Federated Learning via Uncertainty-Aware Inward and Outward Inspection

arXiv 2308.02747 ↗First posted 4 Aug 2023cs.LG cs.DC cs.MAcited by 3

Not on the map. Why?

Abstract (arXiv)

In this work, we introduce SureFED, a novel framework for byzantine robust federated learning. Unlike many existing defense methods that rely on statistically robust quantities, making them vulnerable to stealthy and colluding attacks, SureFED establishes trust using the local information of benign clients. SureFED utilizes an uncertainty aware model evaluation and introspection to safeguard against poisoning attacks. In particular, each client independently trains a clean local model exclusively using its local dataset, acting as the reference point for evaluating model updates. SureFED leverages Bayesian models that provide model uncertainties and play a crucial role in the model evaluation process. Our framework exhibits robustness even when the majority of clients are compromised, remains agnostic to the number of malicious clients, and is well-suited for non-IID settings. We theoretically prove the robustness of our algorithm against data and model poisoning attacks in a decentralized linear regression setting. Proof-of Concept evaluations on benchmark image classification data demonstrate the superiority of SureFED over the state of the art defense methods under various colluding and non-colluding data and model poisoning attacks.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 22 of its 41 references that are in the map. First posted on arXiv 4 Aug 2023.

Builds on

22 of 41 references.

References · 22

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  3. 2018LEAF: A Benchmark for Federated Settingscited by 780
  4. 2018How To Backdoor Federated Learningcited by 745
  5. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
  6. 2018Analyzing Federated Learning through an Adversarial Lenscited by 346
  7. 2020FLTrust: Byzantine-robust Federated Learning via Trust Bootstrappingcited by 330
  8. 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 324
  9. 2019Robust Aggregation for Federated Learningcited by 314
  10. 2019A Little Is Enough: Circumventing Defenses For Distributed Learningcited by 285
  11. 2019Can You Really Backdoor Federated Learning?cited by 250
  12. 2020Threats to Federated Learning: A Surveycited by 171
10 more
  1. 2020Learning from History for Byzantine Robust Optimizationcited by 137
  2. 2019BrainTorrent: A Peer-to-Peer Environment for Decentralized Federated Learningcited by 115
  3. 2018Generalized Byzantine-tolerant SGDcited by 94
  4. 2019Peer-to-peer Federated Learning on Graphscited by 85
  5. 2020Federated Learning via Posterior Averaging: A New Perspective and Practical Algorithmscited by 78
  6. 2019Zeno++: Robust Fully Asynchronous SGDcited by 53
  7. 2023Backdoor Attacks in Peer-to-Peer Federated Learningcited by 9
  8. 2022zPROBE: Zero Peek Robustness Checks for Federated Learningcited by 6
  9. 2014Nonasymptotic Convergence Rates for Cooperative Learning Over Time-Varying Directed Graphscited by 5
  10. 2022Network-Level Adversaries in Federated Learningcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 2.

3 papers.