Adversary-Robust Learning from Fully Asynchronous Directional Derivative Estimates
Not on the map. Why?
Abstract (arXiv)
We propose FAR-SIGN (Fully Asynchronous Robust optimization via SIGNed directional projections) for adversary-resilient learning in parameter-server--worker systems. FAR-SIGN achieves robustness through sign-based updates along carefully designed directions and mitigates the resulting bias via a two-timescale mechanism. It admits both first-order and zeroth-order implementations and enables fully asynchronous execution without requiring a private reference dataset at the server. We establish almost-sure convergence of FAR-SIGN to the set of stationary points for smooth, nonconvex objectives. Moreover, we prove the near-optimal rate of O(n-1/4+ε) in the first-order setting and the standard O(n-1/6+ε) in the zeroth-order setting, where n is the iteration count and ε>0 can be chosen arbitrarily small. Experiments on MNIST show that FAR-SIGN outperforms robust aggregation-based methods in both accuracy and wall-clock time.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 37 references that are in the map. First posted on arXiv 10 May 2026.
Builds on
25 of 37 references.
References · 25
- 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
- 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 716
- 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
- 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 561
- 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 324
- 2019Robust Aggregation for Federated Learningcited by 314
- 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 306
- 2019Lower Bounds for Non-Convex Stochastic Optimizationcited by 303
- 2019A Little Is Enough: Circumventing Defenses For Distributed Learningcited by 285
- 2020Byzantine-Robust Learning on Heterogeneous Datasets via Bucketingcited by 125
- 2019Robust Federated Learning in a Heterogeneous Environmentcited by 88
13 more
- 2018Byzantine Stochastic Gradient Descentcited by 81
- 2018DRACO: Byzantine-resilient Distributed Training via Redundant Gradientscited by 74
- 2019Zeno++: Robust Fully Asynchronous SGDcited by 53
- 2016A Comprehensive Linear Speedup Analysis for Asynchronous Stochastic Parallel Optimization from Zeroth-Order to First-Ordercited by 43
- 2022AFLGuard: Byzantine-robust Asynchronous Federated Learningcited by 29
- 2020Byzantine-Resilient SGD in High Dimensions on Heterogeneous Datacited by 17
- 2019Data Encoding for Byzantine-Resilient Distributed Optimizationcited by 10
- 2016Stochastic Recursive Inclusions in two timescales with non-additive iterate dependent Markov noisecited by 7
- 2020Non-asymptotic bounds for stochastic optimization with biased noisy gradient oraclescited by 5
- 2020Buffered Asynchronous SGD for Byzantine Learningcited by 4
- 2024Communication-Efficient Byzantine-Resilient Federated Zero-Order Optimizationcited by 4
- 2025Byzantine-Resilient Zero-Order Optimization for Communication-Efficient Heterogeneous Federated Learningcited by 4
- 2023Online Learning with Adversaries: A Differential-Inclusion Analysiscited by 3
Built on by
Not cited yet.