Fetching the paper…
Reading the bibliography…
Could a gradient aggregation rule (GAR) for distributed machine learning be both robust and fast? This paper answers by the affirmative through multi-Bulyan.
Multivariate estimation with high breakdown point
1985
Earlier work this paper cites.
Principal component analysis
1987
Earlier work this paper cites.
Online learning and stochastic approximations
1998
Earlier work this paper cites.
Neural networks and learning machines
2009
Earlier work this paper cites.
Poisoning attacks against support vector machines
2012
Earlier work this paper cites.
Large scale distributed deep networks
2012
Earlier work this paper cites.
The datacenter as a computer: An introduction to the design of warehouse-scale machines
2013
Earlier work this paper cites.
Scaling distributed machine learning with the parameter server
2014
Earlier work this paper cites.
Understanding machine learning: From theory to algorithms
2014
Earlier work this paper cites.
Deep learning with elastic averaging sgd
2015
Earlier work this paper cites.
Tensorflow: A system for large-scale machine learning
2016
Earlier work this paper cites.
Mllib: Machine learning in apache spark
2016
Cited alongside, same era.
Machine learning with adversaries: Byzantine tolerant gradient descent
2017
Cited alongside, same era.
Accurate, large minibatch sgd: training imagenet in 1 hour
2017
Cited alongside, same era.
Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms
2017
Cited alongside, same era.
Draco: Robust distributed training via redundant gradients
2018
Cited alongside, same era.
The hidden vulnerability of distributed learning in Byzantium
signSGD with majority vote is communication efficient and fault tolerant
2019
Closest in time.
Aggregathor: : Byzantine machine learning via robust gradient aggregation
2019
Closest in time.
Byzantine-robust federated machine learning through adaptive model averaging
2019
Closest in time.
Detox: A redundancy-based framework for faster and more robust gradient aggregation
2019
Closest in time.
Aggregation rules based on stochastic gradient descent in byzantine consensus
2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
2018
Cited alongside, same era.
Securing distributed machine learning in high dimensions
2018
Cited alongside, same era.
Generalized Byzantine-tolerant sgd
2018
Cited alongside, same era.
Byzantine-robust distributed learning: Towards optimal statistical rates
2018
Cited alongside, same era.
A little is enough: Circumventing defenses for distributed learning
2019
Cited alongside, same era.
2019
Closest in time.
Byrdie: Byzantine-resilient distributed coordinate descent for decentralized learning
2019
Closest in time.
Adversary-resilient inference and machine learning: From distributed to decentralized
2019
Closest in time.
Robust Distributed Learning
2020
Closest in time.
{DBA}: Distributed backdoor attacks against federated learning
2020
Closest in time.