Fetching the paper…
Reading the bibliography…
In decentralized optimization, nodes of a communication network each possess a local objective function, and communicate using gossip-based methods in order to minimize the average of these per-node functions.
Differential—difference equations
Kenneth L Cooke · 1963
Earlier work this paper cites.
Differential-difference equations
K. L. Cooke R. Bellman · 1965
Earlier work this paper cites.
Piecewise-deterministic markov processes: A general class of non-diffusion stochastic models
M. H. A. Davis · 1984
Earlier work this paper cites.
Parallel and distributed computation: numerical methods , volume 23
Dimitri P Bertsekas · 1989
Earlier work this paper cites.
Loss networks
F. P. Kelly · 1991
Earlier work this paper cites.
The laplacian spectrum of graphs
Mohar, Y Alavi, G Chartrand, and OR Oellermann · 1991
Earlier work this paper cites.
Braess’s paradox in a loss network
N. G. Bean, F. P. Kelly, and P. G. Taylor · 1997
Earlier work this paper cites.
Theorems of perron-frobenius type for matrices without sign restrictions
S.M. Rump · 1997
Earlier work this paper cites.
Delay effects on stability: a robust control approach , volume 269
Silviu-Iulian Niculescu · 2001
Earlier work this paper cites.
Stability of distributed congestion control with heterogeneous feedback delays
Laurent Massoulié · 2002
Earlier work this paper cites.
Randomized gossip algorithms
Stephen Boyd, Arpita Ghosh, Balaji Prabhakar, and Devavrat Shah · 2006
Earlier work this paper cites.
Stability of linear time-varying delay systems and applications to control problems
Vu N. Phat and Piyapong Niamsup · 2006
Earlier work this paper cites.
Lyapunov–krasovskii functional for uniform stability of coupled differential-functional equations
Keqin Gu and Yi Liu · 2009
Earlier work this paper cites.
Distributed subgradient methods for multi-agent optimization
A. Nedic and A. Ozdaglar · 2009
Earlier work this paper cites.
Gossip algorithms for distributed signal processing
A. G. Dimakis, S. Kar, J. M. F. Moura, M. G. Rabbat, and A. Scaglione · 2010
Earlier work this paper cites.
Networks, Crowds, and Markets: Reasoning about a Highly Connected World
David Easley and Jon Kleinberg · 2010
Earlier work this paper cites.
Hogwild!: A lock-free approach to parallelizing stochastic gradient descent
Benjamin Recht, Christopher Re, Stephen Wright, and Feng Niu · 2011
Earlier work this paper cites.
Matrix analysis
Roger Horn · 2012
Earlier work this paper cites.
The Poisson Point Process , pages 543–561
Achim Klenke · 2014
Cited alongside, same era.
Cooperative distributed optimization in multiagent networks with delays
Huiwei Wang, Xiaofeng Liao, Tingwen Huang, and Chaojie Li · 2014
Cited alongside, same era.
Convex optimization: Algorithms and complexity
Sébastien Bubeck · 2015
Cited alongside, same era.
Dual coordinate descent algorithms for multi-agent optimization
Jie Lu, Hamid Reza Feyzmahdavian, and Mikael Johansson · 2015
Cited alongside, same era.
EXTRA: An exact first-order algorithm for decentralized consensus optimization
Wei Shi, Qing Ling, Gang Wu, and Wotao Yin · 2015
Cited alongside, same era.
Brownian Motion, Martingales, and Stochastic Calculus , volume 274
Jean-François Le Gall · 2016
Cited alongside, same era.
A2BCD: Asynchronous acceleration with optimal complexity
Robert Hannah, Fei Feng, and Wotao Yin · 2019
Later among the works it cites.
Decentralized stochastic optimization and gossip algorithms with compressed communication
Anastasia Koloskova, Sebastian Stich, and Martin Jaggi · 2019
Later among the works it cites.
Optimal convergence rates for convex distributed optimization in networks
Kevin Scaman, Francis Bach, Sébastien Bubeck, Yin Lee, and Laurent Massoulié · 2019
Later among the works it cites.
The error-feedback framework: Better rates for sgd with delayed gradients and compressed communication
Sebastian U. Stich and Sai Praneeth Karimireddy · 2019
Later among the works it cites.
Matcha: Speeding up decentralized sgd via matching decomposition sampling
Jianyu Wang, Anit Kumar Sahu, Zhouyi Yang, Gauri Joshi, and Soummya Kar · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Distributed mirror descent method for multi-agent optimization with delay
Jueyou Li, Guo Chen, Zhao Yang Dong, and Zhiyou Wu · 2016
Cited alongside, same era.
Perturbed iterate analysis for asynchronous stochastic optimization
Horia Mania, Xinghao Pan, Dimitris Papailiopoulos, Benjamin Recht, Kannan Ramchandran, and Michael I. Jordan · 2017
Cited alongside, same era.
Optimal algorithms for smooth and strongly convex distributed optimization in networks
Kevin Scaman, Francis Bach, Sébastien Bubeck, Yin Tat Lee, and Laurent Massoulié · 2017
Cited alongside, same era.
Asynchronous coordinate descent under more realistic assumption
Tao Sun, Robert Hannah, and Wotao Yin · 2017
Cited alongside, same era.
Decentralized consensus optimization with asynchrony and delays
Tianyu Wu, Kun Yuan, Qing Ling, Wotao Yin, and Ali H. Sayed · 2017
Cited alongside, same era.
Improved asynchronous parallel optimization analysis for stochastic incremental methods
Remi Leblond, Fabian Pedregosa, and Simon Lacoste-Julien · 2018
Cited alongside, same era.
Mahmoud Assran, Arda Aytekin, Hamid Reza Feyzmahdavian, Mikael Johansson, and Michael G Rabbat · 2020
Later among the works it cites.
Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup
Yun Kuen Cheung, Richard Cole, and Yixin Tao · 2020
Later among the works it cites.
Asynchrony and acceleration in gossip algorithms
Mathieu Even, Hadrien Hendrikx, and Laurent Massoulié · 2020
Later among the works it cites.
Dual-free stochastic decentralized optimization with variance reduction
Hadrien Hendrikx, Francis Bach, and Laurent Massoulié · 2020
Later among the works it cites.
Optimal and practical algorithms for smooth and strongly convex decentralized optimization
Dmitry Kovalev, Adil Salim, and Peter Richtárik · 2020
Later among the works it cites.
Achieving linear convergence in distributed asynchronous multiagent optimization
Ye Tian, Ying Sun, and Gesualdo Scutari · 2020
Later among the works it cites.
A dual approach for optimal algorithms in distributed optimization over networks
César A Uribe, Soomin Lee, Alexander Gasnikov, and Angelia Nedić · 2020
Later among the works it cites.
Accelerated primal-dual algorithms for distributed smooth convex optimization over networks
Jinming Xu, Ye Tian, Ying Sun, and Gesualdo Scutari · 2020
Later among the works it cites.
Asynchronous gradient push
Mahmoud S. Assran and Michael G. Rabbat · 2021
Closest in time.
A continuized view on nesterov acceleration for stochastic gradient descent and randomized gossip
Mathieu Even, Raphaël Berthier, Francis Bach, Nicolas Flammarion, Pierre Gaillard, Hadrien Hendrikx, Laurent Massoulié, and Adrien Taylor · 2021
Closest in time.
Lower bounds and optimal algorithms for smooth and strongly convex decentralized optimization over time-varying networks
Dmitry Kovalev, Elnur Gasanov, Alexander Gasnikov, and Peter Richtárik · 2021
Closest in time.
Exponential graph is provably efficient for decentralized deep training
Bicheng Ying, Kun Yuan, Yiming Chen, Hanbin Hu, Pan Pan, and Wotao Yin · 2021
Closest in time.
Asynchronous sgd beats minibatch sgd under arbitrary delays, 2022
Konstantin Mishchenko, Francis Bach, Mathieu Even, and Blake Woodworth · 2022
Closest in time.