Robust Distributed Gradient Descent with Arbitrary Number of Byzantine Attackers

8 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Zeno++: Robust Fully Asynchronous SGD (2019, background): “…tolerance to Byzantine failures (Blanchard et al., 2017; Chen et al., 2017; Yin et al., 2018; Feng et al., 2014; Su & Vaidya, 2016; 2018; Xie et al., 2019b; Alistarh et al., 2018; Cao & Lai, 2018; Xie et al., 2019c) has become an important topic in the distributed machine learning literature.”
Distributed Gradient Descent Algorithm Robust to an Arbitrary Number of Byzantine Attackers (2019, background): “This paper was presented in part at the IEEE International Conference on Acoustics, Speech and Signal Processing, AB, Canada, April 2018 [1].”
Zeno++: robust asynchronous SGD with arbitrary number of Byzantine workers (2019, unknown): “ algorithms assume that the non-Byzantine workers dominate the entire set of workers. However, in practice, there are no guarantees that the number of Byzantine workers can be controlled. Cao and Lai [3], Xie et al. [18] propose synchronous SGD algorithms for an unbounded number of Byzantine workers”