mlsanityData to 7 Oct 2026

Byzantine-Robust Federated Learning with Variance Reduction and Differential Privacy

arXiv 2309.03437 ↗First posted 7 Sep 2023cs.LG cs.CRcited by 8

Not on the map. Why?

Abstract (arXiv)

Federated learning (FL) is designed to preserve data privacy during model training, where the data remains on the client side (i.e., IoT devices), and only model updates of clients are shared iteratively for collaborative learning. However, this process is vulnerable to privacy attacks and Byzantine attacks: the local model updates shared throughout the FL network will leak private information about the local training data, and they can also be maliciously crafted by Byzantine attackers to disturb the learning. In this paper, we propose a new FL scheme that guarantees rigorous privacy and simultaneously enhances system robustness against Byzantine attacks. Our approach introduces sparsification- and momentum-driven variance reduction into the client-level differential privacy (DP) mechanism, to defend against Byzantine attackers. The security design does not violate the privacy guarantee of the client-level DP mechanism; hence, our approach achieves the same client-level DP guarantee as the state-of-the-art. We conduct extensive experiments on both IID and non-IID datasets and different tasks and evaluate the performance of our approach against different Byzantine attacks by comparing it with state-of-the-art defense methods. The results of our experiments show the efficacy of our framework and demonstrate its ability to improve system robustness against Byzantine attacks while achieving a strong privacy guarantee.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 24 of its 42 references that are in the map. First posted on arXiv 7 Sep 2023.

Builds on

24 of 42 references.

References · 24

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  3. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  4. 2016Membership Inference Attacks against Machine Learning Modelscited by 2,221
  5. 2020Adaptive Federated Optimizationcited by 1,036
  6. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
  7. 2019Local Model Poisoning Attacks to Byzantine-Robust Federated Learningcited by 479
  8. 2017Differentially Private Federated Learning: A Client Level Perspectivecited by 451
  9. 2021Opacus: User-Friendly Differential Privacy Library in PyTorchcited by 375
  10. 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 324
  11. 2019Can You Really Backdoor Federated Learning?cited by 250
  12. 2019Differentially Private Learning with Adaptive Clippingcited by 218
12 more
  1. 2018A Hybrid Approach to Privacy-Preserving Federated Learningcited by 208
  2. 2018Generalized Byzantine-tolerant SGDcited by 94
  3. 2020Byzantine-Resilient Secure Federated Learningcited by 93
  4. 2020FastSecAgg: Scalable Secure Aggregation for Privacy-Preserving Federated Learningcited by 60
  5. 2017Distributed Statistical Machine Learning in Adversarial Settings: Byzantine Gradient Descentcited by 59
  6. 2021SparseFed: Mitigating Model Poisoning Attacks in Federated Learning with Sparsificationcited by 46
  7. 2022Federated Learning with Sparsified Model Perturbation: Improving Accuracy under Client-Level Differential Privacycited by 32
  8. 2020Federated Learning with Sparsification-Amplified Privacy and Adaptive Optimizationcited by 25
  9. 2020Trading Data For Learning: Incentive Mechanism For On-Device Federated Learningcited by 21
  10. 2021Differential Privacy and Byzantine Resilience in SGD: Do They Add Up?cited by 17
  11. 2022Bridging Differential Privacy and Byzantine-Robustness via Model Aggregationcited by 12
  12. 2020Hardware Memory Management for Future Mobile Hybrid Memory Systemscited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 4; 2026: 1.

8 papers.