mlsanityData to 7 Oct 2026

Tolerating Adversarial Attacks and Byzantine Faults in Distributed Machine Learning

arXiv 2109.02018 ↗First posted 5 Sep 2021cs.CR cs.AI cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Adversarial attacks attempt to disrupt the training, retraining and utilizing of artificial intelligence and machine learning models in large-scale distributed machine learning systems. This causes security risks on its prediction outcome. For example, attackers attempt to poison the model by either presenting inaccurate misrepresentative data or altering the models' parameters. In addition, Byzantine faults including software, hardware, network issues occur in distributed systems which also lead to a negative impact on the prediction outcome. In this paper, we propose a novel distributed training algorithm, partial synchronous stochastic gradient descent (ParSGD), which defends adversarial attacks and/or tolerates Byzantine faults. We demonstrate the effectiveness of our algorithm under three common adversarial attacks again the ML models and a Byzantine fault during the training phase. Our results show that using ParSGD, ML models can still produce accurate predictions as if it is not being attacked nor having failures at all when almost half of the nodes are being compromised or failed. We will report the experimental evaluations of ParSGD in comparison with other algorithms.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 14 of its 38 references that are in the map. First posted on arXiv 5 Sep 2021.

Builds on

14 of 38 references.

References · 14

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  3. 2019Advances and Open Problems in Federated Learningcited by 3,021
  4. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
  5. 2019Local Model Poisoning Attacks to Byzantine-Robust Federated Learningcited by 479
  6. 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 324
  7. 2018Horovod: fast and easy distributed deep learning in TensorFlowcited by 275
  8. 2016QSGD: Communication-Efficient SGD via Gradient Quantization and Encodingcited by 147
  9. 2019Bit-Flip Attack: Crushing Neural Network with Progressive Bit Searchcited by 106
  10. 2018Generalized Byzantine-tolerant SGDcited by 94
  11. 2018DRACO: Byzantine-resilient Distributed Training via Redundant Gradientscited by 74
  12. 2019Zeno++: Robust Fully Asynchronous SGDcited by 53
2 more
  1. 2019Election Coding for Distributed Learning: Protecting SignSGD against Byzantine Attackscited by 20
  2. 2016High-Level Programming Abstractions for Distributed Graph Processingcited by 2

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 1.

3 papers.