Genuinely distributed Byzantine machine learning

Abstract Machine learning (ML) solutions are nowadays distributed, according to the so-called server/worker architecture. One server holds the model parameters while several workers train the model. Clearly, such architecture is prone to various types of component failures, which can be all encompassed within the spectrum of a Byzantine behavior. Several approaches have been proposed recently to tolerate Byzantine workers. Yet all require trusting a central parameter server. We initiate in this paper the study of the “general” Byzantine-resilient distributed machine learning problem where no individual component is trusted. In particular, we distribute the parameter server computation on several nodes. We show that this problem can be solved in an asynchronous system, despite the presence of $$\frac{1}{3}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mfrac> <mml:mn>1</mml:mn> <mml:mn>3</mml:mn> </mml:mfrac> </mml:math> Byzantine parameter servers (i.e., $$n_{ps} &gt; 3f_{ps}+1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>n</mml:mi> <mml:mrow> <mml:mi>ps</mml:mi> </mml:mrow> </mml:msub> <mml:mo>&gt;</mml:mo> <mml:mn>3</mml:mn> <mml:msub> <mml:mi>f</mml:mi> <mml:mrow> <mml:mi>ps</mml:mi> </mml:mrow> </mml:msub> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> ) and $$\frac{1}{3}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mfrac> <mml:mn>1</mml:mn> <mml:mn>3</mml:mn> </mml:mfrac> </mml:math> Byzantine workers (i.e., $$n_w &gt; 3f_w$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>n</mml:mi> <mml:mi>w</mml:mi> </mml:msub> <mml:mo>&gt;</mml:mo> <mml:mn>3</mml:mn> <mml:msub> <mml:mi>f</mml:mi> <mml:mi>w</mml:mi> </mml:msub> </mml:mrow> </mml:math> ), which is asymptotically optimal. We present a new algorithm, ByzSGD , which solves the general Byzantine-resilient distributed machine learning problem by relying on three major schemes. The first, scatter/gather , is a communication scheme whose goal is to bound the maximum drift among models on correct servers. The second, distributed median contraction (DMC), leverages the geometric properties of the median in high dimensional spaces to bring parameters within the correct servers back close to each other, ensuring safe and lively learning. The third, Minimum-diameter averaging ( MDA ), is a statistically-robust gradient aggregation rule whose goal is to tolerate Byzantine workers. MDA requires a loose bound on the variance of non-Byzantine gradient estimates, compared to existing alternatives [e.g., Krum (Blanchard et al., in: Neural information processing systems, pp 118-128, 2017)]. Interestingly, ByzSGD ensures Byzantine resilience without adding communication rounds (on a normal path), compared to vanilla non-Byzantine alternatives. ByzSGD requires, however, a larger number of messages which, we show, can be reduced if we assume synchrony. We implemented ByzSGD on top of both TensorFlow and PyTorch, and we report on our evaluation results. In particular, we show that ByzSGD guarantees convergence with around 32% overhead compared to vanilla SGD. Furthermore, we show that ByzSGD ’s throughput overhead is 24–176% in the synchronous case and 28–220% in the asynchronous case.