The paper introduces stabilized proximal decentralized optimization methods that achieve the best known communication and computation complexities, optimal up to log factors when local functions are sufficiently similar.
Convex optimization: Algorithms and complexity
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization
The paper introduces stabilized proximal decentralized optimization methods that achieve the best known communication and computation complexities, optimal up to log factors when local functions are sufficiently similar.