The paper develops two variants of a distributed inexact SCA-ADMM algorithm and proves first-order convergence rate guarantees under mild assumptions for non-convex problems with robustness to errors and delays.
QSGD: Communication-efficient sgd via gradient quantization and encoding
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distributed Inexact Successive Convex Approximation ADMM: Analysis-Part I
The paper develops two variants of a distributed inexact SCA-ADMM algorithm and proves first-order convergence rate guarantees under mild assumptions for non-convex problems with robustness to errors and delays.