Abstract
Distributed learning allows the implementation of algorithms that require much more computing power or memory capacity than a single machine can provide. However, this poses the problem of the confidence that must be placed in the work of each of the computing nodes. In this paper we are interested in the ability of the distributed gradient descent algorithm to tolerate Byzantine nodes and successfully converge to the correct optimum. The FABA algorithm of Qi Xia et al. tolerates up to 30% of Byzantine workers. We propose three new variants of this algorithm to improve its resilience to Byzantine workers. We realise it by using the distance to the isobarycenter, the interquartile range and the Z-score to identify Byzantine workers. The conducted experiments show that the proposed variants enhance the resilience of FABA. While the FABA algorithm tolerates 30% of Byzantine workers, the proposed variants tolerate up to 45%. Additionally, the variant based on the Z-score achieves convergence in less than 100 epochs, whereas the original FABA algorithm requires more than 150 epochs to reach the same level of convergence. In summary, the new proposed variants improve the resilience of the distributed gradient descent algorithm FABA by tolerating a higher percentage of Byzantine workers and accelerating convergence towards the desired optimum.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alex, G., Andrew, C., Tim, K.: Distributed Machine Learning. Springer, New York (2018)
Bottow, L.: Large scale machine learning with stochastic gradient descent. In: Lechevallier, Y., Saporta, G. (eds.) COMPSTAT 2010. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-7908-2604-3_16
Haykin, S.S.: Neural Networks and Learning Machines, 3rd edn. Pearson, Upper Saddle River (2009)
Blanchard, P., Guerraoui, R., Stainer, J., et al.: Machine learning with adversaries: byzantine tolerant gradient. In: 31st Conference on Neural Information Processing Systems (NIPS 2017) (2017)
Yin, D., Chen, Y., Kannan, R., Bartlett, P.: Byzantine-robust distributed learning: towards optimal statistical rates. arXiv preprint arXiv:1803.01498 (2018)
Xia, Q., Tao, Z., Hao, Z., Li, Q.: FABA: an algorithm for fast aggregation against byzantine attacks in distributed neural networks. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI 2019) (2019)
El Mahdi, M., Sébastien, R., Rachid, G.: The hidden vulnerability of distributed learning in byzantium. arXiv preprint arXiv:1802.07927 (2018)
Fang, M., Cao, X., Jia, J., Gong, N.Z.: Local model poisoning attacks to byzantine-robust federated learning. In: 29th \(\{\)USENIX\(\}\) Security Symposium (\(\{\)USENIX\(\}\) Security 2020) (2020)
Xie, C., Koyejo, O., Gupta, I.: Generalized byzantine-tolerant SGD. CoRR, abs/1802.10116 (2018)
Abadi, M., et al.: Tensorflow: a system for large-scale machine learning. In: Proceeding of the 12th USENIX Symposium on Operating Systems Design and Implementation(OSDI), Svannah, Georgia, USA (2016)
Acknowledgments
This work has been funded by the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant agreement No 101007666, the Agency is not responsible for this results or use that may be made of the information.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Noutcha Ngapi, J., Melatagia Yonta, P. (2024). Improving the Resilience of Gradient-Based Distributed Learning Algorithms with FABA. In: Arai, K. (eds) Advances in Information and Communication. FICC 2024. Lecture Notes in Networks and Systems, vol 920. Springer, Cham. https://doi.org/10.1007/978-3-031-53963-3_33
Download citation
DOI: https://doi.org/10.1007/978-3-031-53963-3_33
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-53962-6
Online ISBN: 978-3-031-53963-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)