Fetching the paper…
Reading the bibliography…
We consider the distributed optimization problem, the goal of which is to minimize the sum of local objective functions over a directed network.
J. Tsitsiklis, D. Bertsekas, and M. Athans, “Distributed asynchronous deterministic and stochastic gradient optimization algorithms,” IEEE Transactions on Automatic Control , vol. 31, no. 9, pp. 803–812, 1986
1986
Earlier work this paper cites.
S. Li and T. Başar, “Asymptotic agreement and convergence of asynchronous stochastic algorithms,” IEEE Transactions on Automatic Control , vol. 32, no. 7, pp. 612–618, 1987
1987
Earlier work this paper cites.
A. Nedić and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,” IEEE Transactions on Automatic Control , vol. 54, no. 1, pp. 48–61, 2009
2009
Earlier work this paper cites.
A. Nedić, “Asynchronous broadcast-based convex optimization over a network,” IEEE Transactions on Automatic Control , vol. 56, no. 6, pp. 1337–1351, 2010
2010
Earlier work this paper cites.
A. Nedić and A. Ozdaglar, “Convergence rate for consensus with delays,” Journal of Global Optimization , vol. 47, no. 3, pp. 437–456, 2010
2010
Earlier work this paper cites.
K. I. Tsianos, S. Lawlor, and M. G. Rabbat, “Consensus-based distributed optimization: Practical issues and applications in large-scale machine learning,” in 50th Annual Allerton Conference on Communication, Control, and Computing . IEEE, 2012, pp. 1543–1550
2012
Earlier work this paper cites.
B. Touri, Product of random stochastic matrices and distributed averaging . Springer Science & Business Media, 2012
2012
Earlier work this paper cites.
P. Bianchi, W. Hachem, and F. Iutzeler, “A coordinate descent primal-dual algorithm and application to distributed asynchronous optimization,” IEEE Transactions on Automatic Control , vol. 61, no. 10, pp. 2947–2957, 2015
2015
Earlier work this paper cites.
W. Shi, Q. Ling, G. Wu, and W. Yin, “Extra: An exact first-order algorithm for decentralized consensus optimization,” SIAM Journal on Optimization , vol. 25, no. 2, pp. 944–966, 2015
2015
Earlier work this paper cites.
A. Nedić and A. Olshevsky, “Distributed optimization over time-varying directed graphs,” IEEE Transactions on Automatic Control , vol. 60, no. 3, pp. 601–615, 2015
2015
Earlier work this paper cites.
P. Lin, W. Ren, and Y. Song, “Distributed multi-agent optimization subject to nonidentical constraints and communication delays,” Automatica , vol. 65, pp. 120–131, 2016
2016
Earlier work this paper cites.
I. Notarnicola and G. Notarstefano, “Asynchronous distributed optimization via randomized dual proximal gradient,” IEEE Transactions on Automatic Control , vol. 62, no. 5, pp. 2095–2106, 2016
2016
Earlier work this paper cites.
H. Karimi, J. Nutini, and M. Schmidt, “Linear convergence of gradient and proximal-gradient methods under the Polyak-łojasiewicz condition,” in Joint European Conference on Machine Learning and Knowledge Discovery in Databases . Springer, 2016, pp. 795–811
2016
Earlier work this paper cites.
A. Nedić and A. Olshevsky, “Stochastic gradient-push for strongly convex functions on time-varying directed graphs,” IEEE Transactions on Automatic Control , vol. 61, no. 12, pp. 3936–3947, 2016
2016
Earlier work this paper cites.
A. Nedić, A. Olshevsky, and W. Shi, “Achieving geometric convergence for distributed optimization over time-varying graphs,” SIAM Journal on Optimization , vol. 27, no. 4, pp. 2597–2633, 2017
2017
Earlier work this paper cites.
G. Qu and N. Li, “Harnessing smoothness to accelerate distributed optimization,” IEEE Transactions on Control of Network Systems , 2017
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 International Conference on Machine Learning , 2017, pp. 3027–3036
2017
Cited alongside, same era.
D. Dheeru and E. Karra Taniskidou, “UCI machine learning repository,” 2017. [Online]. Available: http://archive.ics.uci.edu/ml
2017
Cited alongside, same era.
J. Zhang, K. You, and T. Başar, “Distributed discrete-time optimization in multiagent networks using only sign of relative state,” IEEE Transactions on Automatic Control , vol. 64, no. 6, pp. 2352–2367, 2018
2018
Cited alongside, same era.
Z. Li, W. Shi, and M. Yan, “A decentralized proximal-gradient method with network independent step-sizes and separated convergence rates,” IEEE Transactions on Signal Processing , vol. 67, no. 17, pp. 4494–4506, 2019
2019
Closest in time.
K. Yuan, B. Ying, X. Zhao, and A. H. Sayed, “Exact diffusion for distributed optimization and learning—part i: Algorithm development,” IEEE Transactions on Signal Processing , vol. 67, no. 3, pp. 708–723, 2019
2019
Closest in time.
H. Sun and M. Hong, “Distributed non-convex first-order optimization and information processing: Lower complexity bounds and rate optimal algorithms,” IEEE Transactions on Signal processing , vol. 67, no. 22, pp. 5912–5928, 2019
2019
Closest in time.
G. Scutari and Y. Sun, “Distributed nonconvex constrained optimization over time-varying digraphs,” Mathematical Programming , vol. 176, no. 1-2, pp. 497–544, 2019
2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
X. Lian, W. Zhang, C. Zhang, and J. Liu, “Asynchronous decentralized parallel stochastic gradient descent,” in Proceedings of the 35th International Conference on Machine Learning , 2018, pp. 3049–3058
2018
Cited alongside, same era.
H. Tang, X. Lian, M. Yan, C. Zhang, and J. Liu, “ D 2 {D}^{2} : Decentralized training over decentralized data,” in Proceedings of the 35th International Conference on Machine Learning , 2018, pp. 4848–4856
2018
Cited alongside, same era.
T. Wu, K. Yuan, Q. Ling, W. Yin, and A. H. Sayed, “Decentralized consensus optimization with asynchrony and delays,” IEEE Transactions on Signal and Information Processing over Networks , vol. 4, no. 2, pp. 293–307, 2018
2018
Cited alongside, same era.
J. Xu, S. Zhu, Y. C. Soh, and L. Xie, “Convergence of asynchronous distributed gradient methods over stochastic networks,” IEEE Transactions on Automatic Control , vol. 63, no. 2, pp. 434–448, 2018
2018
Cited alongside, same era.
K. Scaman, F. Bach, S. Bubeck, L. Massoulié, and Y. T. Lee, “Optimal algorithms for non-smooth distributed optimization in networks,” in Advances in Neural Information Processing Systems , 2018, pp. 2745–2754
2018
Cited alongside, same era.
C. Xi, V. S. Mai, R. Xin, E. H. Abed, and U. A. Khan, “Linear convergence in optimization over directed graphs with row-stochastic matrices,” IEEE Transactions on Automatic Control , vol. 63, no. 10, pp. 3558–3565, 2018
2018
Cited alongside, same era.
P. Xie, K. You, R. Tempo, S. Song, and C. Wu, “Distributed convex optimization with inequality constraints over time-varying unbalanced digraphs,” IEEE Transactions on Automatic Control , vol. 63, no. 12, pp. 4331–4337, 2018
2018
Cited alongside, same era.
R. Xin and U. A. Khan, “A linear algorithm for optimization over directed graphs with geometric convergence,” IEEE Control Systems Letters , vol. 2, no. 3, pp. 315–320, July 2018
2018
Cited alongside, same era.
J. Zhang and K. You, “Asyspa: An exact asynchronous algorithm for convex optimization over digraphs,” IEEE Transactions on Automatic Control , vol. 65, no. 6, pp. 2494–2509, 2020
2020
Closest in time.
M. Assran, A. Aytekin, H. R. Feyzmahdavian, M. Johansson, and M. G. Rabbat, “Advances in asynchronous parallel and distributed optimization,” Proceedings of the IEEE , vol. 108, no. 11, pp. 2013–2031, 2020
2020
Closest in time.
Y. Tian, Y. Sun, and G. Scutari, “Achieving linear convergence in distributed asynchronous multi-agent optimization,” IEEE Transactions on Automatic Control , 2020
2020
Closest in time.
M. Assran and M. Rabbat, “Asynchronous gradient-push,” IEEE Transactions on Automatic Control , 2020
2020
Closest in time.
2020
Closest in time.
R. Xin, S. Kar, and U. A. Khan, “Decentralized stochastic optimization and machine learning: A unified variance-reduction framework for robust performance and fast convergence,” IEEE Signal Processing Magazine , vol. 37, no. 3, pp. 102–113, 2020
2020
Closest in time.
Y. Lu and C. De Sa, “Moniqua: Modulo quantized communication in decentralized SGD,” in Proceedings of the 37th International Conference on Machine Learning , ser. Proceedings of Machine Learning Research, vol. 119. Virtual: PMLR, 2020, pp. 6415–6425
2020
Closest in time.
S. Pu, W. Shi, J. Xu, and A. Nedic, “Push-pull gradient methods for distributed optimization in networks,” IEEE Transactions on Automatic Control , pp. 1–1, 2020
2020
Closest in time.
F. Saadatniaki, R. Xin, and U. A. Khan, “Decentralized optimization over time-varying directed graphs with row and column-stochastic matrices,” IEEE Transactions on Automatic Control , vol. 65, no. 11, pp. 4769–4780, 2020
2020
Closest in time.
A. Spiridonoff, A. Olshevsky, and I. C. Paschalidis, “Robust asynchronous stochastic gradient-push: Asymptotically optimal and network-independent performance for strongly convex functions.” Journal of Machine Learning Research , vol. 21, no. 58, pp. 1–47, 2020
2020
Closest in time.