Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup
Crossref DOI link: https://doi.org/10.1007/s10107-020-01552-8
Published Online: 2020-09-07
Published Print: 2021-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Cheung, Yun Kuen
Cole, Richard
Tao, Yixin http://orcid.org/0000-0002-0573-1369
Funding for this research was provided by:
National Science Foundation (CCF-1527568)
National Science Foundation (CCF-1217989, CCF-1909538)
Text and Data Mining valid from 2020-09-07
Version of Record valid from 2020-09-07
Article History
Received: 7 May 2019
Accepted: 4 August 2020
First Online: 7 September 2020