Learning from History for Byzantine Robust Optimization
From MaRDI portal
Publication:6356449
arXiv2012.10333MaRDI QIDQ6356449
Author name not available (Why is that?)
Publication date: 18 December 2020
Abstract: Byzantine robustness has received significant attention recently given its importance for distributed and federated learning. In spite of this, we identify severe flaws in existing algorithms even when the data across the participants is identically distributed. First, we show realistic examples where current state of the art robust aggregation rules fail to converge even in the absence of any Byzantine attackers. Secondly, we prove that even if the aggregation rules may succeed in limiting the influence of the attackers in a single round, the attackers can couple their attacks across time eventually leading to divergence. To address these issues, we present two surprisingly simple strategies: a new robust iterative clipping procedure, and incorporating worker momentum to overcome time-coupled attacks. This is the first provably robust method for the standard stochastic optimization setting. Our code is open sourced at https://github.com/epfml/byzantine-robust-optimizer.
Has companion code repository: https://github.com/epfml/byzantine-robust-optimizer
This page was built for publication: Learning from History for Byzantine Robust Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6356449)
