Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descent (Q6287091)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descent |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descent |
preprint article from arXiv |
Statements
25 May 2017
0 references
math.OC
0 references
cs.DC
0 references
cs.LG
0 references
stat.ML
0 references
Xiangru Lian
0 references
Ce Zhang
0 references
Huan Zhang
0 references
Cho-Jui Hsieh
0 references
Wei Zhang
0 references
Ji Liu
0 references
