Fetching the paper…
Reading the bibliography…
In this work, we study the problem of minimizing the sum of strongly convex functions split over a network of $n$ nodes.
Synchronization and linearity: an algebra for discrete event systems
F. Baccelli, G. Cohen, G. J. Olsder, and J.-P. Quadrat · 1992
Earlier work this paper cites.
Randomized gossip algorithms
S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah · 2006
Earlier work this paper cites.
A randomized incremental subgradient method for distributed optimization in networked systems
B. Johansson, M. Rabi, and M. Johansson · 2009
Earlier work this paper cites.
Distributed subgradient methods for multi-agent optimization
A. Nedic and A. Ozdaglar · 2009
Earlier work this paper cites.
Large-scale machine learning with stochastic gradient descent
L. Bottou · 2010
Earlier work this paper cites.
Hogwild: A lock-free approach to parallelizing stochastic gradient descent
B. Recht, C. Re, S. Wright, and F. Niu · 2011
Earlier work this paper cites.
Dual averaging for distributed optimization: Convergence analysis and network scaling
J. C. Duchi, A. Agarwal, and M. J. Wainwright · 2012
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
R. Johnson and T. Zhang · 2013
Earlier work this paper cites.
Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems
Y. T. Lee and A. Sidford · 2013
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Bourse , volume 87
Y. Nesterov · 2013
Earlier work this paper cites.
Stochastic dual coordinate ascent methods for regularized loss minimization
S. Shalev-Shwartz and T. Zhang · 2013
Earlier work this paper cites.
Saga: A fast incremental gradient method with support for non-strongly convex composite objectives
A. Defazio, F. Bach, and S. Lacoste-Julien · 2014
Earlier work this paper cites.
An accelerated proximal coordinate gradient method
Q. Lin, Z. Lu, and L. Xiao · 2014
Cited alongside, same era.
Proximal algorithms
N. Parikh, S. Boyd, et al · 2014
Cited alongside, same era.
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
S. Shalev-Shwartz and T. Zhang · 2014
Cited alongside, same era.
Convex optimization: Algorithms and complexity
S. Bubeck et al · 2015
Cited alongside, same era.
Extra: An exact first-order algorithm for decentralized consensus optimization
W. Shi, Q. Ling, G. Wu, and W. Yin · 2015
Cited alongside, same era.
Revisiting distributed synchronous sgd
J. Chen, X. Pan, R. Monga, S. Bengio, and R. Jozefowicz · 2016
Cited alongside, same era.
Achieving geometric convergence for distributed optimization over time-varying graphs
A. Nedic, A. Olshevsky, and W. Shi · 2017
Later among the works it cites.
Efficiency of the accelerated coordinate descent method on structured optimization problems
Y. Nesterov and S. U. Stich · 2017
Later among the works it cites.
Optimal algorithms for smooth and strongly convex distributed optimization in networks
K. Scaman, F. Bach, S. Bubeck, Y. T. Lee, and L. Massoulié · 2017
Later among the works it cites.
Minimizing finite sums with the stochastic average gradient
M. Schmidt, N. Le Roux, and F. Bach · 2017
Later among the works it cites.
Dscovr: Randomized primal-dual block coordinate algorithms for asynchronous distributed optimization
L. Xiao, A. W. Yu, Q. Lin, and W. Chen · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Gossip dual averaging for decentralized optimization of pairwise functions
I. Colin, A. Bellet, J. Salmon, and S. Clémençon · 2016
Cited alongside, same era.
A simple practical accelerated method for finite sums
A. Defazio · 2016
Cited alongside, same era.
Asaga: asynchronous parallel saga
R. Leblond, F. Pedregosa, and S. Lacoste-Julien · 2016
Cited alongside, same era.
Dsa: Decentralized double stochastic averaging gradient algorithm
A. Mokhtari and A. Ribeiro · 2016
Cited alongside, same era.
Katyusha: The first direct acceleration of stochastic gradient methods
Z. Allen-Zhu · 2017
Cited alongside, same era.
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
Cited in the paper.
H. Hendrikx, L. Massoulié, and F. Bach · 2018
Later among the works it cites.
A delay-tolerant proximal-gradient algorithm for distributed learning
K. Mishchenko, F. Iutzeler, J. Malick, and M.-R. Amini · 2018
Later among the works it cites.
A. Olshevsky, I. C. Paschalidis, and A. Spiridonoff · 2018
Later among the works it cites.
Z. Shen, A. Mokhtari, T. Zhou, P. Zhao, and H. Qian · 2018
Later among the works it cites.
d 2 d^{2} : Decentralized training over decentralized data
H. Tang, X. Lian, M. Yan, C. Zhang, and J. Liu · 2018
Later among the works it cites.
Throughput scalability analysis of fork-join queueing networks
Y. Zeng, A. Chaintreau, D. Towsley, and C. H. Xia · 2018
Later among the works it cites.