DiMA's claimed O(kappa^2 epsilon^{-2}) communication complexity omits a (1-lambda)^{-3} factor that follows from the paper's own Eq. (14).
Communication-efficient learning of deep networks from decentralized data
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Communication-Efficient Decentralized Stochastic Minimax Optimization
DiMA's claimed O(kappa^2 epsilon^{-2}) communication complexity omits a (1-lambda)^{-3} factor that follows from the paper's own Eq. (14).