Byzantine fault tolerance in distributed machine learning: a survey

8Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

Abstract

Byzantine Fault Tolerance (BFT) is crucial for ensuring the resilience of Distributed Machine Learning (DML) systems during training under adversarial conditions. Among the rising corpus of research on BFT in DML, there is no comprehensive classification of techniques or broad analysis of different approaches. This paper provides an in-depth survey of recent advancements in BFT for DML, with a focus on first-order optimisation methods, particularly, the popular one Stochastic Gradient Descent (SGD) during the training phase. We offer a novel classification of BFT approaches based on characteristics such as the communication process, optimisation method, and topology setting. This classification aims to enhance the understanding of various BFT methods and guide future research in addressing open challenges in the field. This work provides the foundations for developing robust BFT systems, using a variety of optimisation methods to strengthen resilience.

Cite

CITATION STYLE

APA

Bouhata, D., Moumen, H., Mazari, J. A., & Bounceur, A. (2025). Byzantine fault tolerance in distributed machine learning: a survey. Journal of Experimental and Theoretical Artificial Intelligence, 37(8), 1331–1389. https://doi.org/10.1080/0952813X.2024.2391778

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free