Fetching the paper…
Reading the bibliography…
We consider the federated learning problem where data on workers are not independent and identically distributed (i.i.d.).
L. Lamport, R. E. Shostak, and M. C. Pease, “The byzantine generals problem,” ACM Transactions on Programming Languages and Systems , vol. 4, no. 3, pp. 382–401, 1982
1982
Earlier work this paper cites.
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE , vol. 86, no. 11, pp. 2278–2324, 1998. [Online]. Available: http://yann.lecun.com/exdb/mnist/
1998
Earlier work this paper cites.
1999
Earlier work this paper cites.
E. Weiszfeld and F. Plastria, “On the point for which the sum of the distances to n given points is minimum,” Annals of Operations Research , vol. 167, no. 1, pp. 7–41, 2009
2009
Earlier work this paper cites.
L. Bottou, “Large-scale machine learning with stochastic gradient descent,” in International Conference on Computational Statistics , 2010, pp. 177–186
2010
Earlier work this paper cites.
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
Y. Chen, L. Su, and J. Xu, “Distributed statistical machine learning in adversarial settings: Byzantine gradient descent,” ACM on Measurement and Analysis of Computing Systems , vol. 1, no. 2, pp. 1–25, 2017
2017
Earlier work this paper cites.
P. Blanchard, R. Guerraoui, J. Stainer et al. , “Machine learning with adversaries: Byzantine tolerant gradient descent,” in Advances in Neural Information Processing Systems , 2017, pp. 119–129
2017
Earlier work this paper cites.
2018
Earlier work this paper cites.
Y. Zhu, W. Yu, G. Wen, and G. Chen, “Projected primal–dual dynamics for distributed constrained nonsmooth convex optimization,” IEEE Transactions on Cybernetics , vol. 50, no. 4, pp. 1776–1782, 2018
2018
Earlier work this paper cites.
D. Yin, Y. Chen, R. Kannan, and P. Bartlett, “Byzantine-robust distributed learning: Towards optimal statistical rates,” in International Conference on Machine Learning , 2018, pp. 5650–5659
2018
Earlier work this paper cites.
E. M. El Mhamdi, R. Guerraoui, and S. L. A. Rouault, “The hidden vulnerability of distributed learning in byzantium,” in International Conference on Machine Learning , 2018, pp. 3521–3530
2018
Earlier work this paper cites.
X. Miao, Y. Liu, H. Zhao, and C. Li, “Distributed online one-class support vector machine for anomaly detection over networks,” IEEE Transactions on Cybernetics , vol. 49, no. 4, pp. 1475–1488, 2018
2018
Cited alongside, same era.
Q. Yang, Y. Liu, T. Chen, and Y. Tong, “Federated machine learning: Concept and applications,” ACM Transactions on Intelligent Systems and Technology , vol. 10, no. 2, pp. 1–19, 2019
2019
Cited alongside, same era.
2019
Cited alongside, same era.
J. Park, S. Samarakoon, M. Bennis, and M. Debbah, “Wireless network intelligence at the edge,” Proceedings of the IEEE , vol. 107, no. 11, pp. 2204–2239, 2019
2019
Cited alongside, same era.
C. Xie, O. Koyejo, and I. Gupta, “Fall of empires: Breaking byzantine-tolerant sgd by inner product manipulation,” in Uncertainty in Artificial Intelligence , 2020, pp. 261–270
2020
Closest in time.
T. Li, A. K. Sahu, A. Talwalkar, and V. Smith, “Federated learning: Challenges, methods, and future directions,” IEEE Signal Processing Magazine , vol. 37, no. 3, pp. 50–60, 2020
2020
Closest in time.
X. Cao and L. Lai, “Distributed approximate newton’s method robust to byzantine attackers,” IEEE Transactions on Signal Processing , vol. 68, pp. 6011–6025, 2020
2020
Closest in time.
2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
X. Cao and L. Lai, “Distributed gradient descent algorithm robust to an arbitrary number of byzantine attackers,” IEEE Transactions on Signal Processing , vol. 67, no. 22, pp. 5850–5864, 2019
2019
Cited alongside, same era.
R. Jin, X. He, and H. Dai, “Distributed byzantine tolerant stochastic gradient descent in the era of big data,” in IEEE International Conference on Communications , 2019, pp. 1–6
2019
Cited alongside, same era.
L. Li, W. Xu, T. Chen, G. B. Giannakis, and Q. Ling, “Rsa: Byzantine-robust stochastic aggregation methods for distributed learning from heterogeneous datasets,” in AAAI Conference on Artificial Intelligence , 2019, pp. 1544–1551
2019
Cited alongside, same era.
2019
Cited alongside, same era.
2019
Cited alongside, same era.
2019
Cited alongside, same era.
T. Zeng, O. Semiari, M. Mozaffari, M. Chen, W. Saad, and M. Bennis, “Federated learning in the sky: Joint power allocation and scheduling with uav swarms,” in IEEE International Conference on Communications , 2020, pp. 1–6
2020
Cited alongside, same era.
Z. Yang, A. Gang, and W. U. Bajwa, “Adversary-resilient distributed and decentralized statistical inference and machine learning: An overview of recent advances under the byzantine threat model,” IEEE Signal Processing Magazine , vol. 37, pp. 146–159, 2020
2020
Cited alongside, same era.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
Z. Wu, Q. Ling, T. Chen, and G. B. Giannakis, “Federated variance-reduced stochastic gradient descent with robustness to byzantine attacks,” IEEE Transactions on Signal Processing , vol. 68, pp. 4583–4596, 2020
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
C. Sun, Z. Feng, and G. Hu, “Time-varying optimization-based approach for distributed formation of uncertain euler-lagrange systems,” IEEE Transactions on Cybernetics , 2021
2021
Closest in time.