Distributed Stochastic Optimization on Smooth Strongly Convex Objectives (Theoretical)
1Communication Complexity (Per Iteration)DSGD (RING)
Evaluation Results
| Method | Links | ||
|---|---|---|---|
| DSGD (RING)Size n=ARBITRARY, Based graph=12024.04 | 1 | — | |
| O.-P. EXP.Size n=POWER OF 2, Based graph=Θ(ln(n))2024.04 | 1 | — | |
| RELAYSGDSize n=ARBITRARY, Based graph=12024.04 | 1 | — | |
| OD(OU)-EQUIDYNSize n=ARBITRARY, Based graph=Θ(n)2024.04 | 1 | — | |
| BTPPSize n=ARBITRARY, Based graph=22024.04 | 1 | 1 |