Fetching the paper…
Reading the bibliography…
Many modern large-scale machine learning problems benefit from decentralized and stochastic optimization.
D. P. Bertsekas,
1989
Earlier work this paper cites.
Y. Nesterov, “Introductory lectures on convex programming volume i: Basic course,”
1998
Earlier work this paper cites.
K. Ali and W. Van Stam, “TiVo: making show recommendations using a distributed collaborative filtering architecture,” in
2004
Earlier work this paper cites.
L. Xiao and S. Boyd, “Fast linear iterations for distributed averaging,”
2004
Earlier work this paper cites.
S. Boyd, P. Diaconis, and L. Xiao, “Fastest mixing markov chain on a graph,”
2004
Earlier work this paper cites.
A. Nedic and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,”
2009
Earlier work this paper cites.
I. D. Schizas, G. Mateos, and G. B. Giannakis, “Distributed LMS for consensus-based in-network adaptive processing,”
2009
Earlier work this paper cites.
S. Boyd, N. Parikh, E. Chu, B. Peleato, J. Eckstein
2011
Earlier work this paper cites.
J. C. Duchi, A. Agarwal, and M. J. Wainwright, “Dual averaging for distributed optimization: Convergence analysis and network scaling,”
2011
Earlier work this paper cites.
J. Chen and A. H. Sayed, “Diffusion adaptation strategies for distributed optimization and learning over networks,”
2012
Earlier work this paper cites.
S. Lu, D. Liu, and J. Sun, “A distributed adaptive GSC beamformer over coordinated antenna arrays network for interference mitigation,” in
2012
Earlier work this paper cites.
J. F. Mota, J. M. Xavier, P. M. Aguiar, and M. Püschel, “D-ADMM: A communication-efficient distributed algorithm for separable optimization,”
2013
Earlier work this paper cites.
P. Bianchi and J. Jakubowicz, “Convergence of a multi-agent projected stochastic gradient algorithm for non-convex optimization,”
2013
Earlier work this paper cites.
P. Bianchi, G. Fort, and W. Hachem, “Performance of a distributed stochastic approximation algorithm,”
2013
Earlier work this paper cites.
S. Ghadimi and G. Lan, “Stochastic first-and zeroth-order methods for nonconvex stochastic programming,”
2013
Earlier work this paper cites.
R. Johnson and T. Zhang, “Accelerating stochastic gradient descent using predictive variance reduction,” in
2013
Earlier work this paper cites.
J. Chen, Z. J. Towfic, and A. H. Sayed, “Dictionary learning over distributed models,”
2014
Earlier work this paper cites.
D. Jakovetić, J. M. Moura, and J. Xavier, “Linear convergence rate of a class of distributed augmented lagrangian algorithms,”
2014
Earlier work this paper cites.
S. Lu, V. H. Nascimento, J. Sun, and Z. Wang, “Sparsity-aware adaptive link combination approach over distributed networks,”
2014
Earlier work this paper cites.
W. Shi, Q. Ling, K. Yuan, G. Wu, and W. Yin, “On the linear convergence of the ADMM in decentralized consensus optimization,”
2014
Earlier work this paper cites.
A. Defazio, F. Bach, and S. Lacoste-Julien, “SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives,” in
2014
Earlier work this paper cites.
W. Shi, Q. Ling, G. Wu, and W. Yin, “EXTRA: An exact first-order algorithm for decentralized consensus optimization,”
2015
Cited alongside, same era.
K. Yuan, Q. Ling, and W. Yin, “On the convergence of decentralized gradient descent,”
2016
Cited alongside, same era.
2016
Cited alongside, same era.
P. Di Lorenzo and G. Scutari, “NEXT: In-network nonconvex optimization,”
2016
Cited alongside, same era.
M. Hong, Z.-Q. Luo, and M. Razaviyayn, “Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems,”
2016
Cited alongside, same era.
2018
Later among the works it cites.
C. Fang, C. J. Li, Z. Lin, and T. Zhang, “SPIDER: Near-optimal non-convex optimization via stochastic path-integrated differential estimator,” in
2018
Later among the works it cites.
2018
Later among the works it cites.
D. Zhou, P. Xu, and Q. Gu, “Stochastic nested variance reduced gradient descent for nonconvex optimization,” in
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Daneshmand, G. Scutari, and F. Facchinei, “Distributed dictionary learning,” in
2016
Cited alongside, same era.
S. J. Reddi, A. Hefny, S. Sra, B. Poczos, and A. Smola, “Stochastic variance reduction for nonconvex optimization,” in
2016
Cited alongside, same era.
Z. Allen-Zhu and E. Hazan, “Variance reduction for faster non-convex optimization,” in
2016
Cited alongside, same era.
A. Mokhtari and A. Ribeiro, “DSA: Decentralized double stochastic averaging gradient algorithm,”
2016
Cited alongside, same era.
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
2017
Cited alongside, same era.
M. Hong, D. Hajinezhad, and M.-M. Zhao, “Prox-PDA: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks,” in
2017
Cited alongside, same era.
K. Scaman, F. Bach, S. Bubeck, Y. T. Lee, and L. Massoulié, “Optimal algorithms for smooth and strongly convex distributed optimization in networks,” in
2017
Cited alongside, same era.
2018
Later among the works it cites.
K. Yuan, B. Ying, J. Liu, and A. H. Sayed, “Variance-reduced stochastic learning by networked agents under random reshuffling,”
2018
Later among the works it cites.
K. Yuan, B. Ying, X. Zhao, and A. H. Sayed, “Exact diffusion for distributed optimization and learning—part i: Algorithm development,”
2018
Later among the works it cites.
B. Ying, K. Yuan, S. Vlaski, and A. H. Sayed, “Stochastic learning under random reshuffling with constant step-sizes,”
2018
Later among the works it cites.
S. Pu and A. Nedić, “A distributed stochastic gradient tracking method,” in
2018
Later among the works it cites.
2019
Closest in time.
M. Assran, N. Loizou, N. Ballas, and M. Rabbat, “Stochastic gradient push for distributed deep learning,” in
2019
Closest in time.
S. Lu, X. Zhang, H. Sun, and M. Hong, “GNSD: a gradient-tracking based nonconvex stochastic algorithm for decentralized optimization,” in
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
Z. Wang and H. Li, “Edge-based stochastic gradient algorithm for distributed optimization,”
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
M. Hong, M. Razaviyayn, and J. Lee, “Gradient primal-dual algorithm converges to second-order stationary solution for nonconvex distributed optimization over networks,” in
2023
Closest in time.