ByRDiE: Byzantine-resilient distributed coordinate descent for decentralized learning

Abstract

Distributed machine learning algorithms enable learning of models from datasets that are distributed over a network without gathering the data at a centralized location. While efficient distributed algorithms have been developed under the assumption of faultless networks, failures that can render these algorithms nonfunctional occur frequently in the real world. This paper focuses on the problem of Byzantine failures, which are the hardest to safeguard against in distributed algorithms. While Byzantine fault tolerance has a rich history, existing work does not translate into efficient and practical algorithms for high-dimensional learning in fully distributed (also known as decentralized) settings. In this paper, an algorithm termed Byzantine-resilient distributed coordinate descent (ByRDiE) is developed and analyzed that enables distributed learning in the presence of Byzantine failures. Theoretical analysis (convex settings) and numerical experiments (convex and nonconvex settings) highlight its usefulness for high-dimensional distributed learning in the presence of Byzantine failures.

Preprint of a paper accepted into IEEE Transactions on Signal and Information Processing Over Networks; 16 pages, 5 figures, and 1 table

References in corpus (1)

• Cloud K-SVD: A Collaborative Dictionary Learning Algorithm for Big, Distributed Data

Cited by in corpus (10)

• Adversary-resilient Distributed and Decentralized Statistical Inference and Machine Learning: An Overview of Recent Advances Under the Byzantine Threat Model
• Distributed Learning in the Non-Convex World: From Batch to Streaming Data, and Beyond
• Byzantine-Resilient Distributed Optimization of Multi-Dimensional Functions
• Robust Distributed Optimization With Randomly Corrupted Gradients
• BROADCAST: Reducing Both Stochastic and Compression Noise to Robustify Communication-Efficient Federated Learning
• Scalable Distributed Optimization of Multi-Dimensional Functions Despite Byzantine Adversaries
• Prox-DBRO-VR: A Unified Analysis on Byzantine-Resilient Decentralized Stochastic Composite Optimization with Variance Reduction and Non-Asymptotic Convergence Rates
• Resilience in Online Federated Learning: Mitigating Model-Poisoning Attacks via Partial Sharing
• The Minimizer of the Sum of Two Strongly Convex Functions
• Attacks on Robust Distributed Learning Schemes via Sensitivity Curve Maximization