Fetching the paper…
Reading the bibliography…
Decentralized stochastic optimization has recently benefited from gradient tracking methods \cite{DSGT_Pu,DSGT_Xin} providing efficient solutions for large-scale empirical risk minimization problems.
“Distributed asynchronous deterministic and stochastic gradient optimization algorithms,”
John Tsitsiklis, Dimitri Bertsekas, and Michael Athans, · 1986
Earlier work this paper cites.
“Parallel and distributed computation: numerical methods,”
Dimitri P Bertsekas and John N Tsitsiklis, · 2003
Earlier work this paper cites.
“Distributed subgradient methods for multi-agent optimization,”
Angelia Nedich and Asuman Ozdaglar, · 2009
Earlier work this paper cites.
“Distributed stochastic subgradient projection algorithms for convex optimization,”
S Sundhar Ram, Angelia Nedić, and Venugopal V Veeravalli, · 2010
Earlier work this paper cites.
“Dual averaging for distributed optimization: Convergence analysis and network scaling,”
John C Duchi, Alekh Agarwal, and Martin J Wainwright, · 2011
Earlier work this paper cites.
“Push-sum distributed dual averaging for convex optimization,”
Konstantinos I Tsianos, Sean Lawlor, and Michael G Rabbat, · 2012
Earlier work this paper cites.
“Distributed parameter estimation in sensor networks: Nonlinear observation models and imperfect communication,”
Soummya Kar, José MF Moura, and Kavita Ramanan, · 2012
Earlier work this paper cites.
“Distributed strategies for generating weight-balanced and doubly stochastic digraphs,”
Bahman Gharesifard and Jorge Cortés, · 2012
Earlier work this paper cites.
Matrix analysis
Roger A Horn and Charles R Johnson, · 2012
Earlier work this paper cites.
“Accelerating stochastic gradient descent using predictive variance reduction,”
Rie Johnson and Tong Zhang, · 2013
Earlier work this paper cites.
“On the o (1/k) convergence of asynchronous distributed alternating direction method of multipliers,”
Ermin Wei and Asuman Ozdaglar, · 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.
“Distributed optimization over time-varying directed graphs,”
Angelia Nedić and Alex Olshevsky, · 2014
Earlier work this paper cites.
“On the linear convergence of the admm in decentralized consensus optimization,”
Wei Shi, Qing Ling, Kun Yuan, Gang Wu, and Wotao Yin, · 2014
Earlier work this paper cites.
“Extra: An exact first-order algorithm for decentralized consensus optimization,”
Wei Shi, Qing Ling, Gang Wu, and Wotao Yin, · 2015
Earlier work this paper cites.
“Extra: An exact first-order algorithm for decentralized consensus optimization,”
Wei Shi, Qing Ling, Gang Wu, and Wotao Yin, · 2015
Earlier work this paper cites.
“Dlm: Decentralized linearized alternating direction method of multipliers,”
Qing Ling, Wei Shi, Gang Wu, and Alejandro Ribeiro, · 2015
Earlier work this paper cites.
“Distributed nonconvex optimization over networks,”
Paolo Di Lorenzo and Gesualdo Scutari, · 2015
Earlier work this paper cites.
“An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization,”
Qihang Lin, Zhaosong Lu, and Lin Xiao, · 2015
Earlier work this paper cites.
“Mini-batch semi-stochastic gradient descent in the proximal setting,”
Jakub Konečnỳ, Jie Liu, Peter Richtárik, and Martin Takáč, · 2015
Cited alongside, same era.
“Next: In-network nonconvex optimization,”
Paolo Di Lorenzo and Gesualdo Scutari, · 2016
Cited alongside, same era.
“Stochastic gradient-push for strongly convex functions on time-varying directed graphs,”
Angelia Nedich and Alex Olshevsky, · 2016
Cited alongside, same era.
“Dsa: Decentralized double stochastic averaging gradient algorithm,”
Aryan Mokhtari and Alejandro Ribeiro, · 2016
Cited alongside, same era.
“A simple practical accelerated method for finite sums,”
Aaron Defazio, · 2016
Cited alongside, same era.
“Barzilai-borwein step size for stochastic gradient descent,”
Conghui Tan, Shiqian Ma, Yu-Hong Dai, and Yuqiu Qian, · 2016
Cited alongside, same era.
“Stochastic gradient push for distributed deep learning,”
Mahmoud Assran, Nicolas Loizou, Nicolas Ballas, and Michael Rabbat, · 2018
Later among the works it cites.
“D2: Decentralized training over decentralized data,”
Hanlin Tang, Xiangru Lian, Ming Yan, Ce Zhang, and Ji Liu, · 2018
Later among the works it cites.
Zebang Shen, Aryan Mokhtari, Tengfei Zhou, Peilin Zhao, and Hui Qian, · 2018
Later among the works it cites.
“Variance-reduced stochastic learning by networked agents under random reshuffling,”
Kun Yuan, Bicheng Ying, Jiageng Liu, and Ali H Sayed, · 2018
Later among the works it cites.
“Stochastic learning under random reshuffling with constant step-sizes,”
Bicheng Ying, Kun Yuan, Stefan Vlaski, and Ali H Sayed, · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Harnessing smoothness to accelerate distributed optimization,”
Guannan Qu and Na Li, · 2017
Cited alongside, same era.
“Achieving geometric convergence for distributed optimization over time-varying graphs,”
Angelia Nedic, Alex Olshevsky, and Wei Shi, · 2017
Cited alongside, same era.
“Add-opt: Accelerated distributed directed optimization,”
Chenguang Xi, Ran Xin, and Usman A Khan, · 2017
Cited alongside, same era.
“Optimal algorithms for smooth and strongly convex distributed optimization in networks,”
Kevin Seaman, Francis Bach, Sébastien Bubeck, Yin Tat Lee, and Laurent Massoulié, · 2017
Cited alongside, same era.
“Can decentralized algorithms outperform centralized algorithms? a case study for decentralized parallel stochastic gradient descent,”
Xiangru Lian, Ce Zhang, Huan Zhang, Cho-Jui Hsieh, Wei Zhang, and Ji Liu, · 2017
Cited alongside, same era.
“A distributed stochastic gradient tracking method,”
Shi Pu and Angelia Nedić, · 2018
Cited alongside, same era.
Later among the works it cites.
Lectures on convex optimization
Yurii Nesterov, · 2018
Later among the works it cites.
“Distributed stochastic optimization with gradient tracking over strongly-connected networks,”
Ran Xin, Anit Kumar Sahu, Usman A Khan, and Soummya Kar, · 2019
Closest in time.
“Variance-reduced decentralized stochastic optimization with gradient tracking – Part 1: GT-SAGA,”
Ran Xin, Usman A. Khan, and Soummya Kar, · 2019
Closest in time.
“Accelerated distributed nesterov gradient descent,”
Guannan Qu and Na Li, · 2019
Closest in time.
“Distributed nonconvex constrained optimization over time-varying digraphs,”
Gesualdo Scutari and Ying Sun, · 2019
Closest in time.
“Convergence rate of distributed optimization algorithms based on gradient tracking,”
Ying Sun, Amir Daneshmand, and Gesualdo Scutari, · 2019
Closest in time.
“Communication-efficient distributed optimization in networks with gradient tracking,”
Boyue Li, Shicong Cen, Yuxin Chen, and Yuejie Chi, · 2019
Closest in time.
“On the performance of exact diffusion over adaptive networks,”
Kun Yuan, Sulaiman A Alghunaim, Bicheng Ying, and Ali H Sayed, · 2019
Closest in time.
“Decentralized stochastic gradient tracking for empirical risk minimization,”
Jiaqi Zhang and Keyou You, · 2019
Closest in time.
“Distributed learning in non-convex environments–part i: Agreement at a linear rate,”
Stefan Vlaski and Ali H Sayed, · 2019
Closest in time.
“Distributed learning in non-convex environments–part ii: Polynomial escape from saddle-points,”
Stefan Vlaski and Ali H Sayed, · 2019
Closest in time.
“Edge-based stochastic gradient algorithm for distributed optimization,”
Zheng Wang and Huaqing Li, · 2019
Closest in time.
“Asynchronous accelerated proximal stochastic gradient for strongly convex distributed finite sums,”
Hadrien Hendrikx, Francis Bach, and Laurent Massoulié, · 2019
Closest in time.
“Augmented distributed gradient methods for multi-agent optimization under uncoordinated constant stepsizes,”
Jinming Xu, Shanying Zhu, Yeng Chai Soh, and Lihua Xie, · 2060
Closest in time.