Fetching the paper…
Reading the bibliography…
Communication between workers and the master node to collect local stochastic gradients is a key bottleneck in a large-scale federated learning system.
“On the point for which the sum of the distances to n n given points is minimum,”
Endre Weiszfeld and Frank Plastria, · 2009
Earlier work this paper cites.
“Accelerating stochastic gradient descent using predictive variance reduction,”
Rie Johnson and Tong Zhang, · 2013
Earlier work this paper cites.
“Stochastic dual coordinate ascent methods for regularized loss minimization,”
Shai Shalev-Shwartz and Tong Zhang, · 2013
Earlier work this paper cites.
“SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives,”
Aaron Defazio, Francis Bach, and Simon Lacoste-Julien, · 2014
Earlier work this paper cites.
“Federated learning: Strategies for improving communication efficiency,”
Jakub Konečnỳ, H Brendan McMahan, Felix X Yu, Peter Richtárik, Ananda Theertha Suresh, and Dave Bacon, · 2016
Earlier work this paper cites.
“QSGD: Communication-efficient SGD via gradient quantization and encoding,”
Dan Alistarh, Demjan Grubic, Jerry Li, Ryota Tomioka, and Milan Vojnovic, · 2017
Earlier work this paper cites.
“Terngrad: Ternary gradients to reduce communication in distributed deep learning,”
Wei Wen, Cong Xu, Feng Yan, Chunpeng Wu, Yandan Wang, Yiran Chen, and Hai Li, · 2017
Earlier work this paper cites.
“Zipml: Training linear models with end-to-end low precision, and a little bit of deep learning,”
Hantian Zhang, Jerry Li, Kaan Kara, Dan Alistarh, Ji Liu, and Ce Zhang, · 2017
Earlier work this paper cites.
“Distributed statistical machine learning in adversarial settings: Byzantine gradient descent,”
Yudong Chen, Lili Su, and Jiaming Xu, · 2017
Earlier work this paper cites.
“Machine learning with adversaries: Byzantine tolerant gradient descent,”
Peva Blanchard, El Mahdi El Mhamdi, Rachid Guerraoui, and Julien Stainer, · 2017
Earlier work this paper cites.
“Security and privacy for the industrial internet of things: An overview of approaches to safeguarding endpoints,”
Lu Zhou, Kuo-Hui Yeh, Gerhard Hancke, Zhe Liu, and Chunhua Su, · 2018
Earlier work this paper cites.
“LAG: Lazily aggregated gradient for communication-efficient distributed learning,”
Tianyi Chen, Georgios B Giannakis, Tao Sun, and Wotao Yin, · 2018
Earlier work this paper cites.
“Sparsified SGD with memory,”
Sebastian U Stich, Jean-Baptiste Cordonnier, and Martin Jaggi, · 2018
Earlier work this paper cites.
“Gradient sparsification for communication-efficient distributed optimization,”
Jianqiao Wangni, Jialei Wang, Ji Liu, and Tong Zhang, · 2018
Earlier work this paper cites.
“Randomized distributed mean estimation: Accuracy vs. communication,”
Jakub Konečnỳ and Peter Richtárik, · 2018
Earlier work this paper cites.
“The hidden vulnerability of distributed learning in Byzantium,”
El Mahdi El Mhamdi, Rachid Guerraoui, and Sébastien Rouault, · 2018
Cited alongside, same era.
“The internet of things: Secure distributed inference,”
Yuan Chen, Soummya Kar, and Jose MF Moura, · 2018
Cited alongside, same era.
“Byzantine-robust distributed learning: Towards optimal statistical rates,”
Dong Yin, Yudong Chen, Ramchandran Kannan, and Peter Bartlett, · 2018
Cited alongside, same era.
“Error compensated quantized SGD and its applications to large-scale distributed optimization,”
Jiaxiang Wu, Weidong Huang, Junzhou Huang, and Tong Zhang, · 2018
Cited alongside, same era.
“Variance-reduced stochastic learning by networked agents under random reshuffling,”
Kun Yuan, Bicheng Ying, Jiageng Liu, and Ali H Sayed, · 2018
Cited alongside, same era.
“Doublesqueeze: Parallel stochastic gradient descent with double-pass error-compensated compression,”
Hanlin Tang, Chen Yu, Xiangru Lian, Tong Zhang, and Ji Liu, · 2019
Later among the works it cites.
“RSA: Byzantine-robust stochastic aggregation methods for distributed learning from heterogeneous datasets,”
Liping Li, Wei Xu, Tianyi Chen, Georgios B Giannakis, and Qing Ling, · 2019
Later among the works it cites.
“Distributed approximate Newton’s method robust to byzantine attackers,”
Xinyang Cao and Lifeng Lai, · 2020
Later among the works it cites.
“Adversary-resilient distributed and decentralized statistical inference and machine learning: An overview of recent advances under the Byzantine threat model,”
Zhixiong Yang, Arpita Gang, and Waheed U Bajwa, · 2020
Later among the works it cites.
“Federated variance-reduced stochastic gradient descent with robustness to Byzantine attacks,”
Zhaoxian Wu, Qing Ling, Tianyi Chen, and Georgios B Giannakis, · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Jeremy Bernstein, Jiawei Zhao, Kamyar Azizzadenesheli, and Anima Anandkumar, · 2018
Cited alongside, same era.
“D2: Decentralized training over decentralized data,”
Hanlin Tang, Xiangru Lian, Ming Yan, Ce Zhang, and Ji Liu, · 2018
Cited alongside, same era.
“Federated machine learning: Concept and applications,”
Qiang Yang, Yang Liu, Tianjian Chen, and Yongxin Tong, · 2019
Cited alongside, same era.
“Local SGD converges fast and communicates little,”
Sebastian U Stich, · 2019
Cited alongside, same era.
“Don’t use large mini-batches, use local SGD,”
Tao Lin, Sebastian U Stich, Kumar Kshitij Patel, and Martin Jaggi, · 2019
Cited alongside, same era.
“Distributed gradient descent algorithm robust to an arbitrary number of Byzantine attackers,”
Xinyang Cao and Lifeng Lai, · 2019
Cited alongside, same era.
“Byzantine resilient non-convex SVRG with distributed batch gradient computations,”
Prashant Khanduri, Saikiran Bulusu, Pranay Sharma, and Pramod K Varshney, · 2019
Cited alongside, same era.
“Learning from history for Byzantine robust optimization,”
Sai Praneeth Karimireddy, Lie He, and Martin Jaggi, · 2020
Later among the works it cites.
“A linearly convergent algorithm for decentralized optimization: Sending less bits for free,”
Dmitry Kovalev, Anastasia Koloskova, Martin Jaggi, Peter Richtarik, and Sebastian U Stich, · 2020
Later among the works it cites.
“A double residual compression algorithm for efficient distributed learning,”
Xiaorui Liu, Yao Li, Jiliang Tang, and Ming Yan, · 2020
Later among the works it cites.
“Byzantine-robust learning on heterogeneous datasets via resampling,”
Lie He, Sai Praneeth Karimireddy, and Martin Jaggi, · 2020
Later among the works it cites.
“Byzantine-resilient secure federated learning,”
Jinhyun So, Başak Güler, and A Salman Avestimehr, · 2020
Later among the works it cites.
“Communication-efficient robust federated learning over heterogeneous datasets,”
Yanjie Dong, Georgios B Giannakis, Tianyi Chen, Julian Cheng, Md Hossain, and Victor Leung, · 2020
Later among the works it cites.
“Advances and open problems in federated learning,”
Peter Kairouz and H Brendan McMahan, · 2021
Closest in time.
“Communication-efficient and Byzantine-robust distributed learning with error feedback,”
Avishek Ghosh, Raj Kumar Maity, Swanand Kadhe, Arya Mazumdar, and Kannan Ramchandran, · 2021
Closest in time.
“Byzantine-robust and privacy-preserving framework for fedml,”
Hanieh Hashemi, Yongqin Wang, Chuan Guo, and Murali Annavaram, · 2021
Closest in time.