Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup
Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup
复制标题
全异步随机坐标下降:并行性的严格下限实现线性加速
DOI:
10.1007/s10107-020-01552-8
复制
发表时间:
2020
影响因子:
2.7
通讯作者:
Tao, Yixin
中科院分区:
文献类型:
--
作者:
Cheung, Yun Kuen;Cole, Richard;Tao, Yixin
We seek tight bounds on the viable parallelism in asynchronous implementations of coordinate descent that achieves linear speedup. We focus on asynchronous coordinate descent (ACD) algorithms on convex functions which consist of the sum of a smooth convex part and a possibly non-smooth separable convex part. We quantify the shortfall in progress compared to the standard sequential stochastic gradient descent. This leads to a simple yet tight analysis of the standard stochastic ACD in a partially asynchronous environment, generalizing and improving the bounds in prior work. We also give a considerably more involved analysis for general asynchronous environments in which the only constraint is that each update can overlap with at mostqothers. The new lower bound on the maximum degree of parallelism attaining linear speedup is tight and improves the best prior bound almost quadratically.
登录
查看更多内容
影响因子:
3.1
作者:
Cheung, Yun Kuen;Cole, Richard J.;Tao, Yixin
通讯作者:
Tao, Yixin
DOI:
10.1109/acc.2012.6315289
发表时间:
2012-06
期刊:
2012 American Control Conference (ACC)
影响因子:
--
作者:
Konstantinos I. Tsianos;M. Rabbat
通讯作者:
Konstantinos I. Tsianos;M. Rabbat
DOI:
--
发表时间:
2008
期刊:
ACM-SIAM Symposium on Discrete Algorithms
影响因子:
--
作者:
B. Awerbuch;Y. Azar;R. Khandekar
通讯作者:
R. Khandekar
DOI:
--
发表时间:
2012
期刊:
ACM Conference on Economics and Computation
影响因子:
--
作者:
Yun Kuen Cheung;R. Cole;Ashish Rastogi
通讯作者:
Ashish Rastogi
DOI:
10.4230/lipics.esa.2018.18
发表时间:
2018
期刊:
ArXiv
影响因子:
--
作者:
Yun Kuen Cheung;R. Cole
通讯作者:
R. Cole