Stochastic Push-Pull achieves linear speedup, O(1/(nε^2)) iteration complexity, over arbitrary strongly connected digraphs in the nonconvex setting.
Scaling distributed machine learning with the parameter server
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the Linear Speedup of the Push-Pull Method for Decentralized Optimization over Digraphs
Stochastic Push-Pull achieves linear speedup, O(1/(nε^2)) iteration complexity, over arbitrary strongly connected digraphs in the nonconvex setting.