List your company

Distributed Stochastic Optimization on Smooth Strongly Convex Objectives (Theoretical)

1Communication Complexity (Per Iteration)DSGD (RING)
0.950.97511.025Apr 8, 2024

Evaluation results

MethodLinks
DSGD (RING)Size n=ARBITRARY, Based graph=12024.041—
O.-P. EXP.Size n=POWER OF 2, Based graph=Θ(ln(n))2024.041—
RELAYSGDSize n=ARBITRARY, Based graph=12024.041—
OD(OU)-EQUIDYNSize n=ARBITRARY, Based graph=Θ(n)2024.041—
BTPPSize n=ARBITRARY, Based graph=22024.0411