Detection and Mitigation of Byzantine Attacks in Distributed Training
Konstantinos Konstantinidis, Namrata Vaswani, and Aditya Ramamoorthy

TL;DR
This paper proposes new algorithms for detecting and mitigating Byzantine attacks in distributed machine learning, improving robustness and accuracy under various attack models.
Contribution
It introduces redundancy-based detection methods that handle both strong and weak Byzantine attacks, with proven convergence and superior performance.
Findings
Reduces distorted gradients by 16%-99% under strong attacks.
Achieves 25% higher classification accuracy on CIFAR-10.
Demonstrates convergence to the optimal point under common assumptions.
Abstract
A plethora of modern machine learning tasks require the utilization of large-scale distributed clusters as a critical component of the training pipeline. However, abnormal Byzantine behavior of the worker nodes can derail the training and compromise the quality of the inference. Such behavior can be attributed to unintentional system malfunctions or orchestrated attacks; as a result, some nodes may return arbitrary results to the parameter server (PS) that coordinates the training. Recent work considers a wide range of attack models and has explored robust aggregation and/or computational redundancy to correct the distorted gradients. In this work, we consider attack models ranging from strong ones: omniscient adversaries with full knowledge of the defense protocol that can change from iteration to iteration to weak ones: randomly chosen adversaries with limited collusion…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Privacy-Preserving Technologies in Data · Anomaly Detection Techniques and Applications
