Generalized Byzantine-tolerant SGD

Authors: Cong Xie, Oluwasanmi Koyejo, Indranil Gupta
Published: 2018-02-27 | Updated: 2018-03-23

Source: https://arxiv.org/abs/1802.10116

PDF: https://arxiv.org/pdf/1802.10116

Labels Predicted by AI

機械学習技術 ロバスト推定 敵対的攻撃分析

Please note that these labels were automatically added by AI. Therefore, they may not be entirely accurate.
For more details, please see the About the Literature Database page.

Abstract

We propose three new robust aggregation rules for distributed synchronous Stochastic Gradient Descent (SGD) under a general Byzantine failure model. The attackers can arbitrarily manipulate the data transferred between the servers and the workers in the parameter server (PS) architecture. We prove the Byzantine resilience properties of these aggregation rules. Empirical analysis shows that the proposed techniques outperform current approaches for realistic use cases and Byzantine attack scenarios.