Fetching the paper…
Reading the bibliography…
Decentralized learning has gained great popularity to improve learning efficiency and preserve data privacy.
L. Lamport, R. Shostak, and M. 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.
J. N. Tsitsiklis, “Problems in decentralized decision making and computation.” Massachusetts Inst of Tech Cambridge Lab for Information and Decision Systems, Tech. Rep., 1984
1984
Earlier work this paper cites.
A. Nedic and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,” IEEE Transactions on Automatic Control , vol. 54, no. 1, p. 48, 2009
2009
Earlier work this paper cites.
A. Krizhevsky, G. Hinton et al. , “Learning multiple layers of features from tiny images,” 2009
2009
Earlier work this paper cites.
R. Langner, “Stuxnet: Dissecting a cyberwarfare weapon,” IEEE Security & Privacy , vol. 9, no. 3, pp. 49–51, 2011
2011
Earlier work this paper cites.
A. Abou-Elailah, F. Dufaux, J. Farah, M. Cagnazzo, and B. Pesquet-Popescu, “Fusion of global and local motion estimation for distributed video coding,” IEEE Transactions on Circuits and Systems for Video Technology , vol. 23, no. 1, pp. 158–172, 2012
2012
Earlier work this paper cites.
T. Chen and S. Lu, “Robust vehicle detection and viewpoint estimation with soft discriminative mixture model,” IEEE Transactions on Circuits and Systems for Video Technology , vol. 27, no. 2, pp. 394–403, 2015
2015
Earlier work this paper cites.
2016
Earlier work this paper cites.
Z. Yang and W. U. Bajwa, “RD-SVM: A resilient distributed support vector machine,” in IEEE International Conference on Acoustics, Speech and Signal Processing , 2016, pp. 2444–2448
2016
Earlier work this paper cites.
L. Su and N. H. Vaidya, “Fault-tolerant multi-agent optimization: Optimal iterative distributed algorithms,” in ACM Symposium on Principles of Distributed Computing , 2016, pp. 425–434
2016
Earlier work this paper cites.
X. Lian, C. Zhang, H. Zhang, C.-J. Hsieh, W. Zhang, and J. Liu, “Can decentralized algorithms outperform centralized algorithms? a case study for decentralized parallel stochastic gradient descent,” in Advances in Neural Information Processing Systems , 2017, pp. 5330–5340
2017
Earlier work this paper cites.
R. Dobbe, D. Fridovich-Keil, and C. Tomlin, “Fully decentralized policies for multi-agent systems: An information theoretic approach,” in Advances in Neural Information Processing Systems , 2017, pp. 2941–2950
2017
Earlier work this paper cites.
M. Antonakakis, T. April, M. Bailey, M. Bernhard, E. Bursztein, J. Cochran, Z. Durumeric, J. A. Halderman, L. Invernizzi, M. Kallitsis et al. , “Understanding the mirai botnet,” in USENIX Security Symposium , 2017, pp. 1093–1110
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.
H. Li, K. Ota, and M. Dong, “Learning IoT in edge: Deep learning for the Internet of Things with edge computing,” IEEE Network , vol. 32, no. 1, pp. 96–101, 2018
2018
Earlier work this paper cites.
H. Tang, S. Gan, C. Zhang, T. Zhang, and J. Liu, “Communication compression for decentralized training,” in Advances in Neural Information Processing Systems , 2018, pp. 7652–7662
2018
Earlier work this paper cites.
A. Gulati, G. S. Aujla, R. Chaudhary, N. Kumar, and M. S. Obaidat, “Deep learning-based content centric data dissemination scheme for Internet of Vehicles,” in IEEE International Conference on Communications , 2018, pp. 1–6
2018
Cited alongside, same era.
J. Yang, L. Qing, W. Zeng, and X. He, “High-order statistical modeling based on a decision tree for distributed video coding,” IEEE Transactions on Circuits and Systems for Video Technology , vol. 29, no. 5, pp. 1488–1502, 2018
2018
Cited alongside, same era.
2018
Cited alongside, same era.
L. Chen, H. Wang, Z. Charles, and D. Papailiopoulos, “DRACO: Byzantine-resilient distributed training via redundant gradients,” in International Conference on Machine Learning , 2018, pp. 903–912
2018
Cited alongside, same era.
G. Baruch, M. Baruch, and Y. Goldberg, “A little is enough: Circumventing defenses for distributed learning,” in Advances in Neural Information Processing Systems , 2019, pp. 8632–8642
2019
Later among the works it cites.
Z. Yang and W. U. Bajwa, “ByRDiE: Byzantine-resilient distributed coordinate descent for decentralized learning,” IEEE Transactions on Signal and Information Processing over Networks , 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E. M. E. Mhamdi, R. Guerraoui, and S. Rouault, “The hidden vulnerability of distributed learning in Byzantium,” in International Conference on Machine Learning , 2018, pp. 3521–3530
2018
Cited alongside, same era.
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
Cited alongside, same era.
L. He, A. Bian, and M. Jaggi, “COLA: Decentralized linear learning,” Advances In Neural Information Processing Systems , 2018
2018
Cited alongside, same era.
Y. Wang, Z. Jiang, X. Chen, P. Xu, Y. Zhao, Y. Lin, and Z. Wang, “E2-Train: Training state-of-the-art CNNs with over 80% energy savings,” in Advances in Neural Information Processing Systems , 2019, pp. 5139–5151
2019
Cited alongside, same era.
J. Chen, K. Li, Q. Deng, K. Li, and S. Y. Philip, “Distributed deep learning model for intelligent video surveillance systems with edge computing,” IEEE Transactions on Industrial Informatics , 2019
2019
Cited alongside, same era.
C. Zhao and A. Basu, “Dynamic deep pixel distribution learning for background subtraction,” IEEE Transactions on Circuits and Systems for Video Technology , vol. 30, no. 11, pp. 4192–4206, 2019
2019
Cited alongside, same era.
2019
Cited alongside, same era.
X. Xie, L. Ma, H. Wang, Y. Li, Y. Liu, and X. Li, “Diffchaser: Detecting disagreements for deep neural networks,” in Proceedings of the International Joint Conference on Artificial Intelligence , 2019, pp. 5772–5778
2019
Cited alongside, same era.
2019
Later among the works it cites.
J. Sun, T. Zhang, X. Xie, L. Ma, Y. Zheng, K. Chen, and Y. Liu, “Stealthy and efficient adversarial attacks against deep reinforcement learning,” in Proceedings of the AAAI Conference on Artificial Intelligence , 2020
2020
Closest in time.
M. Fang, X. Cao, J. Jia, and N. Z. Gong, “Local model poisoning attacks to Byzantine-robust federated learning,” in USENIX Security Symposium , 2020
2020
Closest in time.
J.-y. Sohn, D.-J. Han, B. Choi, and J. Moon, “Election coding for distributed learning: Protecting SignSGD against byzantine attacks,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Closest in time.
N. Konstantinov, E. Frantar, D. Alistarh, and C. Lampert, “On the sample complexity of adversarial multi-source pac learning,” in International Conference on Machine Learning , 2020, pp. 5416–5425
2020
Closest in time.
X. Pan, M. Zhang, D. Wu, Q. Xiao, S. Ji, and M. Yang, “Justinian’s gaavernor: Robust distributed learning with gradient aggregation agent,” pp. 1641–1658, 2020
2020
Closest in time.
J. Peng and Q. Ling, “Byzantine-robust decentralized stochastic optimization,” in IEEE International Conference on Acoustics, Speech and Signal Processing , 2020, pp. 5935–5939
2020
Closest in time.
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
X. Cao, M. Fang, J. Liu, and N. Z. Gong, “Fltrust: Byzantine-robust federated learning via trust bootstrapping,” in The Network Distributed System Security Symposium , 2021
2021
Closest in time.