Fetching the paper…
Reading the bibliography…
We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network whose links are allowed to change in time.
Dvinskikh, D. and Gasnikov, A. (2019) · 1904
Earlier work this paper cites.
Stich, S. U. and Karimireddy, S. P. (2019) · 1909
Earlier work this paper cites.
Proximal splitting algorithms: A tour of recent advances, with new twists
Condat, L., Kitahara, D., Contreras, A., and Hirabayashi, A. (2019) · 1912
Earlier work this paper cites.
Zadeh, L. A. (1961) · 1961
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Nesterov, Y. (2003) · 2003
Earlier work this paper cites.
Distributed optimization in sensor networks
Rabbat, M. and Nowak, R. (2004) · 2004
Earlier work this paper cites.
Dualize, split, randomize: fast nonsmooth optimization algorithms
Salim, A., Condat, L., Mishchenko, K., and Richtárik, P. (2020) · 2004
Earlier work this paper cites.
Multi-consensus decentralized accelerated gradient descent
Ye, H., Luo, L., Zhou, Z., and Zhang, T. (2020) · 2005
Earlier work this paper cites.
Distributed spectrum sensing for cognitive radio networks by exploiting sparsity
Bazerque, J. A. and Giannakis, G. B. (2009) · 2009
Earlier work this paper cites.
Towards accelerated rates for distributed optimization over time-varying networks
Rogozin, A., Lukoshkin, V., Gasnikov, A., Kovalev, D., and Shulgin, E. (2020) · 2009
Earlier work this paper cites.
Estimating time-varying networks
Kolar, M., Song, L., Ahmed, A., Xing, E. P., et al. (2010) · 2010
Earlier work this paper cites.
Libsvm: a library for support vector machines
Chang, C.-C. and Lin, C.-J. (2011) · 2011
Cited alongside, same era.
Optimal decentralized protocol for electric vehicle charging
Gan, L., Topcu, U., and Low, S. H. (2012) · 2012
Cited alongside, same era.
Accelerated gradient methods and dual decomposition in distributed model predictive control
Giselsson, P., Doan, M. D., Keviczky, T., De Schutter, B., and Rantzer, A. (2013) · 2013
Cited alongside, same era.
An o ( 1 / k ) o(1/k) gradient method for network resource allocation problems
Beck, A., Nedić, A., Ozdaglar, A., and Teboulle, M. (2014) · 2014
Cited alongside, same era.
Convex analysis
Rockafellar, R. T. (2015) · 2015
Cited alongside, same era.
Federated learning: Strategies for improving communication efficiency
Panda: A dual linearly converging method for distributed optimization over time-varying undirected graphs
Maros, M. and Jaldén, J. (2018) · 2018
Later among the works it cites.
Error feedback fixes SignSGD and other gradient compression schemes
Karimireddy, S. P., Rebjock, Q., Stich, S., and Jaggi, M. (2019) · 2019
Later among the works it cites.
Accelerated distributed nesterov gradient descent
Qu, G. and Li, N. (2019) · 2019
Later among the works it cites.
Linearly converging error compensated SGD
Gorbunov, E., Kovalev, D., Makarenko, D., and Richtárik, P. (2020) · 2020
Later among the works it cites.
Optimal and practical algorithms for smooth and strongly convex decentralized optimization
Kovalev, D., Salim, A., and Richtárik, P. (2020) · 2020
Later among the works it cites.
Federated learning: Challenges, methods, and future directions
Li, T., Sahu, A. K., Talwalkar, A., and Smith, V. (2020) · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Konečný, J., McMahan, H. B., Yu, F. X., Richtárik, P., Suresh, A. T., and Bacon, D. (2016) · 2016
Cited alongside, same era.
Communication-efficient learning of deep networks from decentralized data
McMahan, B., Moore, E., Ramage, D., Hampson, S., and y Arcas, B. A. (2017) · 2017
Cited alongside, same era.
Achieving geometric convergence for distributed optimization over time-varying graphs
Nedic, A., Olshevsky, A., and Shi, W. (2017) · 2017
Cited alongside, same era.
Optimal algorithms for smooth and strongly convex distributed optimization in networks
Scaman, K., Bach, F., Bubeck, S., Lee, Y. T., and Massoulié, L. (2017) · 2017
Cited alongside, same era.
A sharp convergence rate analysis for distributed accelerated gradient methods
Li, H., Fang, C., Yin, W., and Lin, Z. (2018) · 2018
Cited alongside, same era.
Later among the works it cites.
Push-pull gradient methods for distributed optimization in networks
Pu, S., Shi, W., Xu, J., and Nedic, A. (2020) · 2020
Later among the works it cites.
ADOM: Accelerated decentralized optimization method for time-varying networks
Kovalev, D., Shulgin, E., Richtárik, P., Rogozin, A., and Gasnikov, A. (2021) · 2021
Closest in time.
Accelerated gradient tracking over time-varying graphs for decentralized optimization
Li, H. and Lin, Z. (2021) · 2021
Closest in time.
An optimal algorithm for strongly convex minimization under affine constraints
Salim, A., Condat, L., Kovalev, D., and Richtárik, P. (2021) · 2021
Closest in time.