Robust Federated Learning by Mixture of Experts

Z. Sun, P. Kairouz, A. T. Suresh, and H. B. McMahan, “Can you really backdoor federated learning?” CoRR , vol. abs/1911.07963, 2019. [Online]. Available: http://arxiv.org/abs/1911.07963

Original

1911

Earlier work this paper cites.

P. J. Huber, “Robust estimation of a location parameter,” The Annals of Mathematical Statistics , vol. 35, no. 1, pp. 73– 101, 1964

1964

Earlier work this paper cites.

R. A. Jacobs, M. I. Jordan, S. J. Nowlan, and G. E. Hinton, “Adaptive mixtures of local experts,” Neural computation , 3(1):79–87, 1991

1991

Earlier work this paper cites.

A. Rida, A. Labbi, and C. Pellegrini, “Local experts combination through density decomposition,” in International Workshop on AI and Statistics, Uncertainty ’99 . Morgan Kaufmann, 1999

1999

Earlier work this paper cites.

R. Collobert, S. Bengio, and Y. Bengio, “A parallel mixture of SVMs for very large scale problems,” Neural Computation , vol. 14, no. 5, pp. 1105–1114, 2002

2002

Earlier work this paper cites.

P. McDaniel, N. Papernot, and Z. B. Celik, “Machine learning in adversarial settings,” IEEE Security Privacy , vol. 14, no. 3, pp. 68–72, 2016

2016

Earlier work this paper cites.

H. B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-efficient learning of deep networks from decentralized data,” in AISTATS , 2016

2016

Earlier work this paper cites.

H. B. McMahan, E. Moore, D. Ramage, and B. A. y Arcas, “Federated learning of deep networks using model averaging,” CoRR , vol. abs/1602.05629, 2016. [Online]. Available: http://arxiv.org/abs/1602.05629

Original

2016

Cited alongside, same era.

P. Blanchard, E. M. El Mhamdi, R. Guerraoui, and J. Stainer, “Machine learning with adversaries: Byzantine tolerant gradient descent,” in Advances in Neural Information Processing Systems 30 , I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, Eds. Curran Associates, Inc., 2017, pp. 119–129. [Online]. Available: http://papers.nips.cc/paper/6617-machine-learning-with-adversaries-byzantine-tolerant-gradient-descent.pdf

2017

Cited alongside, same era.

G. Cohen, S. Afshar, J. Tapson, and A. van Schaik, “Emnist: an extension of MNIST to handwritten letters,” arXiv preprint arXiv:1702.05373 , 2017

Original

2017

Cited alongside, same era.

T. Ryffel, A. Trask, M. Dahl, B. Wagner, J. Mancuso, D. Rueckert, and J. Passerat-Palmbach, “A generic framework for privacy preserving deep learning,” arXiv preprint arXiv:1811.04017 , 2018

F. Tramèr, A. Kurakin, N. Papernot, I. Goodfellow, D. Boneh, and P. McDaniel, “Ensemble adversarial training: Attacks and defenses,” 2020

2020

Later among the works it cites.

C. Xie, K. Huang, P.-Y. Chen, and B. Li, “DBA: Distributed backdoor attacks against federated learning,” in International Conference on Learning Representations , 2020. [Online]. Available: https://openreview.net/forum?id=rkgyS0VFvr

2020

Later among the works it cites.

A. Koloskova, N. Loizou, S. Boreiri, M. Jaggi, and S. U. Stich, “A unified theory of decentralized SGD with changing topology and local updates,” 2020

2020

Later among the works it cites.

B. E. Woodworth, K. K. Patel, and N. Srebro, “Minibatch vs local SGD for heterogeneous distributed learning,” in Advances in Neural Information Processing Systems , H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H. Lin, Eds., vol. 33. Curran Associates, Inc., 2020, pp. 6281–6292. [Online]. Available: https://proceedings.neurips.cc/paper/2020/file/45713f6ff2041d3fdfae927b82488db8-Paper.pdf