Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism

DOI10.1137/19M129574XzbMath1458.90510arXiv1811.05087OpenAlexW3128700823MaRDI QIDQ5147036

Yun Kuen Cheung, Yixin Tao, Richard John Cole

Publication date: 2 February 2021

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.05087

zbMATH Keywords

parallelism boundstochastic asynchronous coordinate descent

Mathematics Subject Classification ID

Convex programming (90C25) Sums of independent random variables; random walks (60G50) Parallel algorithms in computer science (68W10) Theory of computing (68Q99)

Related Items (1)

Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup

Cites Work

• Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup
• Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties
• Perturbed Iterate Analysis for Asynchronous Stochastic Optimization
• An Asynchronous Parallel Stochastic Coordinate Descent Algorithm

This page was built for publication: Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism