Communication-Efficient Distributed SGD with Error-Feedback, Revisited
- DOI
- 10.2991/ijcis.d.210412.001How to use a DOI?
- Keywords
- Optimizer; Distributed learning; SGD; Error-feedback; Deep neural networks
- Abstract
We show that the convergence proof of a recent algorithm called dist-EF-SGD for distributed stochastic gradient descent with communication efficiency using error-feedback of Zheng et al., Communication-efficient distributed blockwise momentum SGD with error-feedback, in Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019 (NeurIPS 2019), 2019, pp. 11446–11456, is problematic mathematically. Concretely, the original error bound for arbitrary sequences of learning rate is unfortunately incorrect, leading to an invalidated upper bound in the convergence theorem for the algorithm. As evidences, we explicitly provide several counter-examples, for both convex and nonconvex cases, to show the incorrectness of the error bound. We fix the issue by providing a new error bound and its corresponding proof, leading to a new convergence theorem for the dist-EF-SGD algorithm, and therefore recovering its mathematical analysis.
- Copyright
- © 2021 The Authors. Published by Atlantis Press B.V.
- Open Access
- This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).
Download article (PDF)
View full text (HTML)
Cite this article
TY - JOUR AU - Tran Thi Phuong AU - Le Trieu Phong PY - 2021 DA - 2021/04/20 TI - Communication-Efficient Distributed SGD with Error-Feedback, Revisited JO - International Journal of Computational Intelligence Systems SP - 1373 EP - 1387 VL - 14 IS - 1 SN - 1875-6883 UR - https://doi.org/10.2991/ijcis.d.210412.001 DO - 10.2991/ijcis.d.210412.001 ID - Phuong2021 ER -