Fetching the paper…
Reading the bibliography…
In this paper, we study decentralized online stochastic non-convex optimization over a network of nodes.
“A convergence theorem for non negative almost supermartingales and some applications,”
H. Robbins and D. Siegmund, · 1971
Earlier work this paper cites.
Stochastic approximation and recursive estimation
M. B. Nevelson and R. Z. Hasminskii, · 1976
Earlier work this paper cites.
“Introduction to optimization. 1987,”
B. T Polyak, · 1987
Earlier work this paper cites.
“Distributed stochastic subgradient projection algorithms for convex optimization,”
S. S. Ram, A. Nedić, and V. V. Veeravalli, · 2010
Earlier work this paper cites.
“Discrete-time dynamic average consensus,”
M. Zhu and S. Martínez, · 2010
Earlier work this paper cites.
“Convergence rate analysis of distributed gossip (linear parameter) estimation: Fundamental limits and tradeoffs,”
S. Kar and José M. F. Moura, · 2011
Earlier work this paper cites.
“Penalized likelihood regression for generalized linear models with non-quadratic penalties,”
A. Antoniadis, I. Gijbels, and M. Nikolova, · 2011
Earlier work this paper cites.
“Diffusion adaptation strategies for distributed optimization and learning over networks,”
J. Chen and A. H. Sayed, · 2012
Earlier work this paper cites.
Matrix analysis
R. A. Horn and C. R. Johnson, · 2012
Earlier work this paper cites.
“EXTRA: An exact first-order algorithm for decentralized consensus optimization,”
W. Shi, Q. Ling, G. Wu, and W. Yin, · 2015
Earlier work this paper cites.
“NEXT: In-network nonconvex optimization,”
P. Di Lorenzo and G. Scutari, · 2016
Earlier work this paper cites.
“Linear convergence of gradient and proximal-gradient methods under the polyak-lojasiewicz condition,”
H. Karimi, J. Nutini, and M. Schmidt, · 2016
Earlier work this paper cites.
“Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent,”
X. Lian, C. Zhang, H. Zhang, C.-J. Hsieh, W. Zhang, and J. Liu, · 2017
Earlier work this paper cites.
“Harnessing smoothness to accelerate distributed optimization,”
G. Qu and N. Li, · 2017
Cited alongside, same era.
“Achieving geometric convergence for distributed optimization over time-varying graphs,”
A. Nedich, A. Olshevsky, and W. Shi, · 2017
Cited alongside, same era.
“Optimization methods for large-scale machine learning,”
L. Bottou, F. E. Curtis, and J. Nocedal, · 2018
Cited alongside, same era.
“Exact diffusion for distributed optimization and learning–Part I: Algorithm development,”
K. Yuan, B. Ying, X. Zhao, and A. H. Sayed, · 2018
Cited alongside, same era.
“ D 2 D^{2} : Decentralized training over decentralized data,”
H. Tang, X. Lian, M. Yan, C. Zhang, and J. Liu, · 2018
Cited alongside, same era.
“A linear algorithm for optimization over directed graphs with geometric convergence,”
R. Xin and U. A. Khan, · 2018
“Decentralized stochastic gradient tracking for empirical risk minimization,”
J. Zhang and K. You, · 2019
Later among the works it cites.
“A decentralized proximal-gradient method with network independent step-sizes and separated convergence rates,”
Z. Li, W. Shi, and M. Yan, · 2019
Later among the works it cites.
“A sharp estimate on the transient time of distributed stochastic gradient descent,”
S. Pu, A. Olshevsky, and I. C. Paschalidis, · 2019
Later among the works it cites.
“A general framework for decentralized optimization with first-order methods,”
R. Xin, S. Pu, A. Nedić, and U. A. Khan, · 2020
Closest in time.
“Distributed stochastic gradient descent and convergence to local minima,”
B. Swenson, R. Murray, S. Kar, and H. V. Poor, · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“A push-pull gradient method for distributed optimization in networks,”
S. Pu, W. Shi, J. Xu, and A. Nedich, · 2018
Cited alongside, same era.
“Global convergence of policy gradient methods for the linear quadratic regulator,”
M. Fazel, R. Ge, S. Kakade, and M. Mesbahi, · 2018
Cited alongside, same era.
“Network topology and communication-computation tradeoffs in decentralized optimization,”
A. Nedić, A. Olshevsky, and M. G. Rabbat, · 2018
Cited alongside, same era.
“Stochastic gradient push for distributed deep learning,”
M. Assran, N. Loizou, N. Ballas, and M. Rabbat, · 2019
Cited alongside, same era.
“Distributed learning in non-convex environments–Part II: Polynomial escape from saddle-points,”
S. Vlaski and A. H. Sayed, · 2019
Cited alongside, same era.
“Distributed nonconvex constrained optimization over time-varying digraphs,”
G. Scutari and Y. Sun, · 2019
Cited alongside, same era.
Closest in time.
“Distributed stochastic gradient tracking methods,”
S. Pu and A. Nedich, · 2020
Closest in time.
“On the influence of bias-correction on distributed stochastic optimization,”
K. Yuan, S. A. Alghunaim, B. Ying, and A. H. Sayed, · 2020
Closest in time.
“Distributed zero-order algorithms for nonconvex multi-agent optimization,”
Y. Tang, J. Zhang, and N. Li, · 2020
Closest in time.
“Asymptotic network independence in distributed stochastic optimization for machine learning: Examining distributed and centralized stochastic gradient descent,”
S. Pu, A. Olshevsky, and I. C. Paschalidis, · 2020
Closest in time.
“Variance-reduced decentralized stochastic optimization with accelerated convergence,”
R. Xin, U. A. Khan, and S. Kar, · 2020
Closest in time.
A. Spiridonoff, A. Olshevsky, and I. C. Paschalidis, · 2020
Closest in time.
“Augmented distributed gradient methods for multi-agent optimization under uncoordinated constant stepsizes,”
J. Xu, S. Zhu, Y. C. Soh, and L. Xie, · 2060
Closest in time.