Fetching the paper…
Reading the bibliography…
We study distributed stochastic gradient (D-SG) method and its accelerated variant (D-ASG) for solving decentralized strongly convex stochastic optimization problems where the objective function is distributed over several computational units, lying on a fixed but arbitrary connected communication graph, subject to local communication constraints where noisy estimates of the gradients are available.
The n n th power of a 2 × 2 2\times 2 matrix
K. S. Williams · 1992
Earlier work this paper cites.
Spectral Graph Theory
F. R. Chung · 1997
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course , volume 87
Y. Nesterov · 2004
Earlier work this paper cites.
Randomized gossip algorithms
S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah · 2006
Earlier work this paper cites.
A convergent incremental gradient method with a constant step size
D. Blatt, A. O. Hero, and H. Gauchman · 2007
Earlier work this paper cites.
Smooth optimization with approximate gradient
A. d’Aspremont · 2008
Earlier work this paper cites.
CVX: Matlab software for disciplined convex programming, 2008
M. Grant, S. Boyd, and Y. Ye · 2008
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Earlier work this paper cites.
Markov Chains and Mixing Times
D. A. Levin, Y. Peres, and E. L. Wilmer · 2009
Earlier work this paper cites.
Distributed subgradient methods for multi-agent optimization
A. Nedic and A. Ozdaglar · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Earlier work this paper cites.
Distributed delayed stochastic optimization
A. Agarwal and J. C. Duchi · 2011
Earlier work this paper cites.
An optimal method for stochastic composite optimization
G. Lan · 2012
Earlier work this paper cites.
Distributed strongly convex optimization
K. I. Tsianos and M. G. Rabbat · 2012
Earlier work this paper cites.
Robustness versus acceleration, Aug. 2014
M. Hardt · 2014
Earlier work this paper cites.
Communication-efficient distributed dual coordinate ascent
M. Jaggi, V. Smith, M. Takác, J. Terhorst, S. Krishnan, T. Hofmann, and M. I. Jordan · 2014
Earlier work this paper cites.
Fast distributed gradient methods
D. Jakovetić, J. Xavier, and J. M. Moura · 2014
Earlier work this paper cites.
Distributed stochastic optimization and learning
O. Shamir and N. Srebro · 2014
Earlier work this paper cites.
Distributed estimation of graph Laplacian eigenvalues by the alternating direction of multipliers method
T. M. D. Tran and A. Y. Kibangou · 2014
Earlier work this paper cites.
Semi-Autonomous Networks: Effective Control of Networked Systems Through Protocols, Design, and Modeling
A. Chapman · 2015
Earlier work this paper cites.
Distributed nonconvex optimization over networks
P. Di Lorenzo and G. Scutari · 2015
Earlier work this paper cites.
From averaging to acceleration, there is only a step-size
N. Flammarion and F. Bach · 2015
Earlier work this paper cites.
Multi-agent mirror descent for decentralized stochastic optimization
M. Rabbat · 2015
Earlier work this paper cites.
Non-uniform stochastic average gradient method for training conditional random fields
M. Schmidt, R. Babanezhad, M. Ahmed, A. Defazio, A. Clifton, and A. Sarkar · 2015
Earlier work this paper cites.
Extra: An exact first-order algorithm for decentralized consensus optimization
W. Shi, Q. Ling, G. Wu, and W. Yin · 2015
Earlier work this paper cites.
On the iteration complexity of oblivious first-order optimization algorithms
Y. Arjevani and O. Shamir · 2016
Cited alongside, same era.
Next: In-network nonconvex optimization
P. Di Lorenzo and G. Scutari · 2016
Cited alongside, same era.
Federated learning: Strategies for improving communication efficiency
J. Konečnỳ, H. B. McMahan, F. X. Yu, P. Richtárik, A. T. Suresh, and D. Bacon · 2016
Cited alongside, same era.
Analysis and design of optimization algorithms via integral quadratic constraints
L. Lessard, B. Recht, and A. Packard · 2016
Cited alongside, same era.
Asynchronous accelerated stochastic gradient descent
Q. Meng, W. Chen, J. Yu, T. Wang, Z. Ma, and T.-Y. Liu · 2016
Cited alongside, same era.
DSA: Decentralized double stochastic averaging gradient algorithm
Optimal algorithms for non-smooth distributed optimization in networks
K. Scaman, F. Bach, S. Bubeck, L. Massoulié, and Y. T. Lee · 2018
Later among the works it cites.
Asynchronous stochastic quasi-Newton MCMC for non-convex optimization
U. Şimşekli, Ç. Yıldız, T. H. Nguyen, G. Richard, and A. T. Cemgil · 2018
Later among the works it cites.
A universally optimal multistage accelerated stochastic gradient method
N. S. Aybat, A. Fallah, M. Gurbuzbalaban, and A. Ozdaglar · 2019
Closest in time.
Accelerated linear convergence of stochastic momentum methods in Wasserstein distances
B. Can, M. Gürbüzbalaban, and L. Zhu · 2019
Closest in time.
D. Dvinskikh and A. Gasnikov · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Mokhtari and A. Ribeiro · 2016
Cited alongside, same era.
Accelerated distributed nesterov gradient descent for smooth and strongly convex functions
G. Qu and N. Li · 2016
Cited alongside, same era.
On the convergence of decentralized gradient descent
K. Yuan, Q. Ling, and W. Yin · 2016
Cited alongside, same era.
Robust and Optimal Control , volume 40
K. Zhou, J. C. Doyle, and K. Glover · 2016
Cited alongside, same era.
Dissipativity theory for Nesterov’s accelerated method
B. Hu and L. Lessard · 2017
Cited alongside, same era.
Superlinearly convergent asynchronous distributed network Newton method
F. Mansoori and E. Wei · 2017
Cited alongside, same era.
Communication-efficient learning of deep networks from decentralized data
B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas · 2017
Cited alongside, same era.
DANA: Scalable out-of-the-box distributed ASGD without retuning, 2019
I. Hakimi, S. Barkai, M. Gabel, and A. Schuster · 2019
Closest in time.
A unification and generalization of exact distributed first-order methods
D. Jakovetić · 2019
Closest in time.
A framework for parallel second order incremental optimization algorithms for solving partially separable problems
K. Kaya, F. Öztoprak, Ş. İ. Birbil, A. T. Cemgil, U. Şimşekli, N. Kuru, H. Koptagel, and M. K. Öztürk · 2019
Closest in time.
Decentralized stochastic optimization and gossip algorithms with compressed communication
A. Koloskova, S. U. Stich, and M. Jaggi · 2019
Closest in time.
A sharp estimate on the transient time of distributed stochastic gradient descent
S. Pu, A. Olshevsky, and I. C. Paschalidis · 2019
Closest in time.
Optimal convergence rates for convex distributed optimization in networks
K. Scaman, F. Bach, S. Bubeck, Y. T. Lee, and L. Massoulié · 2019
Closest in time.
A canonical form for first-order distributed optimization algorithms
A. Sundararajan, B. Van Scoy, and L. Lessard · 2019
Closest in time.
Distributed coupled multi-agent stochastic optimization
S. A. Alghunaim and A. H. Sayed · 2020
Closest in time.
IDEAL: Inexact DEcentralized accelerated augmented Lagrangian method
Y. Arjevani, J. Bruna, B. Can, M. Gurbuzbalaban, S. Jegelka, and H. Lin · 2020
Closest in time.
Robust accelerated gradient methods for smooth strongly convex functions
N. S. Aybat, A. Fallah, M. Gürbüzbalaban, and A. Ozdaglar · 2020
Closest in time.
Bridging the gap between constant step size stochastic gradient descent and Markov chains
A. Dieuleveut, A. Durmus, and F. Bach · 2020
Closest in time.
Decentralized stochastic gradient Langevin dynamics and Hamiltonian Monte Carlo
M. Gürbüzbalaban, X. Gao, Y. Hu, and L. Zhu · 2020
Closest in time.
Communication-efficient algorithms for decentralized and stochastic optimization
G. Lan, S. Lee, and Y. Zhou · 2020
Closest in time.
Decentralized accelerated gradient methods with increasing penalty parameters
H. Li, C. Fang, W. Yin, and Z. Lin · 2020
Closest in time.
Accelerated distributed Nesterov gradient descent
G. Qu and N. Li · 2020
Closest in time.
Analysis and design of first-order distributed optimization algorithms over time-varying graphs
A. Sundararajan, B. Van Scoy, and L. Lessard · 2020
Closest in time.
Distributed heavy-ball: A generalization and acceleration of first-order methods with gradient tracking
R. Xin and U. A. Khan · 2020
Closest in time.
Distributed stochastic gradient tracking methods
S. Pu and A. Nedić · 2021
Closest in time.
A dual approach for optimal algorithms in distributed optimization over networks
C. A. Uribe, S. Lee, A. Gasnikov, and A. Nedić · 2021
Closest in time.