Robustness analytics to data heterogeneity in edge computing

A. Krogh and J. A. Hertz, “A simple weight decay can improve generalization,” in Advances in neural information processing systems , 1992, pp. 950–957

1992

Earlier work this paper cites.

L. Breiman, “Bias, variance, and arcing classifiers,” Tech. Rep. 460, Statistics Department, University of California, Berkeley …, Tech. Rep., 1996

1996

Earlier work this paper cites.

J. J. Verbeek, N. Vlassis, and B. Kröse, “Efficient greedy learning of gaussian mixture models,” Neural computation , vol. 15, no. 2, pp. 469–485, 2003

Original

2002

Earlier work this paper cites.

D. A. Klein and A. B. Cremers, “Boosting scalable gradient features for adaptive real-time tracking,” in 2011 IEEE International Conference on Robotics and Automation . IEEE, 2011, pp. 4411–4416

2011

Earlier work this paper cites.

Z.-H. Zhou, Ensemble methods: foundations and algorithms . CRC press, 2012

2012

Earlier work this paper cites.

N. Srivastava, G. Hinton, A. Krizhevsky, I. Sutskever, and R. Salakhutdinov, “Dropout: a simple way to prevent neural networks from overfitting,” The journal of machine learning research , vol. 15, no. 1, pp. 1929–1958, 2014

2014

Earlier work this paper cites.

Z. Xu, G. Huang, K. Q. Weinberger, and A. X. Zheng, “Gradient boosted feature selection,” in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining , 2014, pp. 522–531

2014

Earlier work this paper cites.

T. Chen, T. He, M. Benesty, V. Khotilovich, and Y. Tang, “Xgboost: extreme gradient boosting,” R package version 0.4-2 , pp. 1–4, 2015

2015

Earlier work this paper cites.

J. Son, I. Jung, K. Park, and B. Han, “Tracking-by-segmentation with online gradient boosting decision tree,” in Proceedings of the IEEE International Conference on Computer Vision , 2015, pp. 3056–3064

2015

Earlier work this paper cites.

S. Ioffe and C. Szegedy, “Batch normalization: Accelerating deep network training by reducing internal covariate shift,” arXiv preprint arXiv:1502.03167 , 2015

Original

2015

Cited alongside, same era.

J. Konečnỳ, H. B. McMahan, F. X. Yu, P. Richtárik, A. T. Suresh, and D. Bacon, “Federated learning: Strategies for improving communication efficiency,” arXiv preprint arXiv:1610.05492 , 2016

Original

2016

Cited alongside, same era.

B. Lakshminarayanan, A. Pritzel, and C. Blundell, “Simple and scalable predictive uncertainty estimation using deep ensembles,” in Advances in neural information processing systems , 2017, pp. 6402–6413

2017

Cited alongside, same era.

A. A. Diro and N. Chilamkurti, “Distributed attack detection scheme using deep learning approach for internet of things,” Future Generation Computer Systems , vol. 82, pp. 761–768, 2018

2018

Cited alongside, same era.

J. Qian, S. Sengupta, and L. K. Hansen, “Active learning solution on distributed edge computing,” arXiv preprint arXiv:1906.10718 , 2019

Original

2019

Later among the works it cites.

J. Qian, S. P. Gochhayat, and L. K. Hansen, “Distributed active learning strategies on edge computing,” in 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom) . IEEE, 2019, pp. 221–226

2019

Later among the works it cites.

T. Nishio and R. Yonetani, “Client selection for federated learning with heterogeneous resources in mobile edge,” in ICC 2019-2019 IEEE International Conference on Communications (ICC) . IEEE, 2019, pp. 1–7

2019

Later among the works it cites.

P. Kairouz, H. B. McMahan, B. Avent, A. Bellet, M. Bennis, A. N. Bhagoji, K. Bonawitz, Z. Charles, G. Cormode, R. Cummings et al. , “Advances and open problems in federated learning,” arXiv preprint arXiv:1912.04977 , 2019

Original