REVIEW 3 cited by
Phocas: dimensional Byzantine-resilient stochastic gradient descent
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 3 Pith papers
-
RED-SEGA:Resilient Decentralized Stochastic Proximal Optimization with Gradient Sketching over Time-Varying Networks
RED-SEGA achieves Byzantine-resilient linear convergence for non-decomposable SRM via gradient sketching and norm-penalized aggregation over time-varying networks.
-
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.
-
Find a Scapegoat: Poisoning Membership Inference Attack and Defense to Federated Learning
FedPoisonMIA uses angularly-masked poisoned gradients to infer membership in federated learning, and the ATM defense reduces its accuracy by trimming directionally-outlying client updates.
Discussion (0). Sign in to comment.