Asynchronous decentralized accelerated stochastic gradient descent
arXiv:1809.09258
Abstract
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. We establish (resp., ) communication complexity and (resp., ) sampling complexity for solving general convex (resp., strongly convex) problems.
References in corpus (4)
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- On the O(1/k) Convergence of Asynchronous Distributed Alternating Direction Method of Multipliers
- Asynchronous Distributed Optimization using a Randomized Alternating Direction Method of Multipliers
- Decentralized Consensus Optimization with Asynchrony and Delays