Fetching the paper…
Reading the bibliography…
Recently emerged federated learning (FL) is an attractive distributed learning framework in which numerous wireless end-user devices can train a global model with the data remained autochthonous.
M. Ribeiro, K. Grolinger, and M. A. Capretz, “Mlaas: Machine learning as a service,” in Proc. of ICMLA , 2015, pp. 896–902
2015
Earlier work this paper cites.
2016
Earlier work this paper cites.
P. Blanchard, E. Mahdi, R. Guerraoui, and J. Stainer, “Machine learning with adversaries: Byzantine tolerant gradient descent,” in Proc. of NeurIPS , 2017, pp. 119–129
2017
Earlier work this paper cites.
2018
Earlier work this paper cites.
D. Yin, Y. Chen, K. Ramchandran, and P. L. Bartlett, “Byzantine-robust distributed learning: Towards optimal statistical rates,” in Proc. of ICML , 2018, pp. 5636–5645
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
E. Mhamdi, R. Guerraoui, and S. Rouault, “The hidden vulnerability of distributed learning in byzantium,” in Proc. of ICML , 2018, pp. 3521–3530
2018
Earlier work this paper cites.
C. Wang, G. Liu, H. Huang, W. Feng, K. Peng, and L. Wang, “Miasec: Enabling data indistinguishability against membership inference attacks in mlaas,” IEEE Transactions on Sustainable Computing , vol. 5, no. 3, pp. 365–376, 2019
2019
Earlier work this paper cites.
Q. Yang, Y. Liu, Y. Cheng, Y. Kang, T. Chen, and H. Yu, “Federated learning,” Synthesis Lectures on Artificial Intelligence and Machine Learning , vol. 13, no. 3, pp. 1–207, 2019
2019
Earlier work this paper cites.
Q. Xia, Z. Tao, Z. Hao, and Q. Li, “FABA: an algorithm for fast aggregation against byzantine attacks in distributed neural networks,” in Proc. of IJCAI , 2019, pp. 4824–4830
2019
Earlier work this paper cites.
2019
Cited alongside, same era.
C. Xie, S. Koyejo, and I. Gupta, “Zeno: Distributed stochastic gradient descent with suspicion-based fault-tolerance,” in Proc. of ICML , 2019, pp. 6893–6901
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 Proc. of AAAI , 2019, pp. 1544–1551
2019
Cited alongside, same era.
2019
Cited alongside, same era.
2020
Later among the works it cites.
W. Wan, J. Lu, S. Hu, L. Y. Zhang, and X. Pei, “Shielding federated learning: A new attack approach and its defense,” in Proc. of WCNC , 2021, pp. 1–7
2021
Closest in time.
X. Cao, M. Fang, J. Liu, and N. Z. Gong, “Fltrust: Byzantine-robust federated learning via trust bootstrapping,” in Proc. of NDSS , 2021
2021
Closest in time.
W. Jeong, J. Yoon, E. Yang, and S. J. Hwang, “Federated semi-supervised learning with inter-client consistency & disjoint learning,” in Proc. of ICLR , 2021
2021
Closest in time.
L. Che, Z. Long, J. Wang, Y. Wang, H. Xiao, and F. Ma, “Fedtrinet: A pseudo labeling method with three players for federated semi-supervised learning,” in Proc. of IEEE International Conference on Big Data (Big Data) , 2021, pp. 715–724
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. Cao, S. Chang, Z. Lin, G. Liu, and D. Sun, “Understanding distributed poisoning attack in federated learning,” in Proc. of IEEE ICPADS , 2019, pp. 233–239
2019
Cited alongside, same era.
X. Cao and L. Lai, “Distributed gradient descent algorithm robust to an arbitrary number of byzantine attackers,” IEEE Trans. Signal Process. , vol. 67, no. 22, pp. 5850–5864, 2019
2019
Cited alongside, same era.
C. Xie, O. Koyejo, and I. Gupta, “SLSGD: secure and efficient distributed on-device machine learning,” in Proc. of KDD , 2019, pp. 213–228
2019
Cited alongside, same era.
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
Cited alongside, same era.
V. Mothukuri, R. M. Parizi, S. Pouriyeh, Y. Huang, A. Dehghantanha, and G. Srivastava, “A survey on security and privacy of federated learning,” Future Generation Computer Systems , vol. 115, pp. 619–640, 2020
2020
Cited alongside, same era.
J. Geiping, H. Bauermeister, H. Dröge, and M. Moeller, “Inverting gradients-how easy is it to break privacy in federated learning?” in Proc. of NeurIPS , 2020, pp. 16 937–16 947
2020
Cited alongside, same era.
2021
Closest in time.
Z. Zhang, Y. Yang, Z. Yao, Y. Yan, J. E. Gonzalez, K. Ramchandran, and M. W. Mahoney, “Improving semi-supervised federated learning by reducing the gradient diversity of models,” in Proc. of IEEE International Conference on Big Data (Big Data) , 2021, pp. 1214–1225
2021
Closest in time.
E. M. El Mhamdi, R. Guerraoui, and S. L. A. Rouault, “Distributed momentum for byzantine-resilient stochastic gradient descent,” in Proc. of ICLR , 2021
2021
Closest in time.
W. Wan, S. Hu, J. Lu, L. Y. Zhang, H. Jin, and Y. He, “Shielding federated learning: Robust aggregation with adaptive client selection,” in Proc. of IJCAI , 2022, pp. 753–760
2022
Closest in time.
K. Pillutla, S. M. Kakade, and Z. Harchaoui, “Robust aggregation for federated learning,” IEEE Trans. Signal Process. , vol. 70, pp. 1142–1154, 2022
2022
Closest in time.
X. Liang, Y. Lin, H. Fu, L. Zhu, and X. Li, “Rscfed: Random sampling consensus federated semi-supervised learning,” in Pro. of CVPR , 2022, pp. 10 154–10 163
2022
Closest in time.