RESIST achieves algorithmic and statistical convergence guarantees for strongly convex, PL, and nonconvex ERM under MITM attacks via multistep consensus gradient descent plus robust screening.
Phocas: dimensional Byzantine-resilient stochastic gradient descent
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We propose a novel robust aggregation rule 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 of the proposed aggregation rules. Empirical analysis shows that the proposed techniques outperform current approaches for realistic use cases and Byzantine attack scenarios.
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
UNVERDICTED 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
RESIST: Resilient Decentralized Learning Using Consensus Gradient Descent
RESIST achieves algorithmic and statistical convergence guarantees for strongly convex, PL, and nonconvex ERM under MITM attacks via multistep consensus gradient descent plus robust screening.