Fetching the paper…
Reading the bibliography…
In this work, we introduce an asynchronous decentralized accelerated stochastic gradient descent type of method for decentralized stochastic optimization, considering communication and synchronization are the major bottlenecks.
The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
L.M. Bregman · 1967
Earlier work this paper cites.
Topics in matrix analysis
Roger A Hom and Charles R Johnson · 1991
Earlier work this paper cites.
Parallel and Distributed Computation: Numerical Methods
D. P. Bertsekas and J. N. Tsitsiklis · 1997
Earlier work this paper cites.
Feature selection via concave minimization and support vector machines
Paul S Bradley and Olvi L Mangasarian · 1998
Earlier work this paper cites.
Coordination of groups of mobile autonomous agents using nearest neighbor rules
A. Jadbabaie, Jie Lin, and A.S. Morse · 2003
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: a basic course
Y. E. Nesterov · 2004
Earlier work this paper cites.
Distributed optimization in sensor networks
M. Rabbat and R. D. Nowak · 2004
Earlier work this paper cites.
1-norm support vector machines
Ji Zhu, Saharon Rosset, Robert Tibshirani, and Trevor J Hastie · 2004
Earlier work this paper cites.
Randomized gossip algorithms
Stephen Boyd, Arpita Ghosh, Balaji Prabhakar, and Devavrat Shah · 2006
Earlier work this paper cites.
Distributed non-autonomous power control through distributed convex optimization
S. S. Ram, V. V. Veeravalli, and A. Nedić · 2009
Earlier work this paper cites.
On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
R. D. C. Monteiro and B. F. Svaiter · 2010
Earlier work this paper cites.
Complexity of variants of tseng’s modified f-b splitting and korpelevich’s methods for hemivariational inequalities with applications to saddle-point and convex optimization problems
R. D. C. Monteiro and B. F. Svaiter · 2011
Cited alongside, same era.
Asynchronous broadcast-based convex optimization over a network
A. Nedić · 2011
Cited alongside, same era.
Distributed asynchronous constrained stochastic optimization
K. Srivastava and A. Nedić · 2011
Cited alongside, same era.
Dual averaging for distributed optimization: Convergence analysis and network scaling
J.C. Duchi, A. Agarwal, and M.J. Wainwright · 2012
Cited alongside, same era.
Distributed pursuit-evasion without mapping or global localization via local frontiers
J. W. Durham, A. Franchi, and F. Bullo · 2012
Cited alongside, same era.
E. Wei and A. Ozdaglar · 2013
Later among the works it cites.
On the linear convergence of the admm in decentralized consensus optimization
W. Shi, Q. Ling, G. Wu, and W. Yin · 2014
Later among the works it cites.
Stochastic proximal gradient consensus over random networks
T. Chang and M. Hong · 2015
Later among the works it cites.
An accelerated linearized alternating direction method of multipliers
Y. Ouyang, Y. Chen, G. Lan, and E. Pasiliao Jr · 2015
Later among the works it cites.
Extra: An exact first-order algorithm for decentralized consensus optimization
W. Shi, Q. Ling, G. Wu, and W. Yin · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization I: A generic algorithmic framework
S. Ghadimi and G. Lan · 2012
Cited alongside, same era.
An optimal method for stochastic composite optimization
G. Lan · 2012
Cited alongside, same era.
Gossip-based random projection algorithm
S. Lee and A. Nedić · 2012
Cited alongside, same era.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, ii: shrinking procedures and optimal algorithms
S. Ghadimi and G. Lan · 2013
Cited alongside, same era.
Asynchronous distributed optimization using a randomized alternating direction method of multipliers
F. Iutzeler, P. Bianchi, P. Ciblat, and Walid Hachem · 2013
Cited alongside, same era.
Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
R. D. C. Monteiro and B. F. Svaiter · 2013
Cited alongside, same era.
Bi-alternating direction method of multipliers over graphs
Guoqiang Zhang and Richard Heusdens · 2015
Later among the works it cites.
A coordinate descent primal-dual algorithm and application to distributed asynchronous optimization
Pascal Bianchi, Walid Hachem, and Franck Iutzeler · 2016
Later among the works it cites.
Decentralized consensus optimization with asynchrony and delays
Tianyu Wu, Kun Yuan, Qing Ling, Wotao Yin, and Ali H Sayed · 2016
Later among the works it cites.
Communication-efficient algorithms for decentralized and stochastic optimization
Guanghui Lan, Soomin Lee, and Yi Zhou · 2017
Later among the works it cites.
Convergence of asynchronous distributed gradient methods over stochastic networks
Jinming Xu, Shanying Zhu, Yeng Chai Soh, and Lihua Xie · 2018
Closest in time.