Communication compression has become a key strategy to speed up distributed optimization. However, existing decentralized algorithms with compression mainly focus on compressing DGD-type algorithms. They are unsatisfactory in terms of convergence rate, stability, and the capability to handle heterogeneous data. Motivated by primal-dual algorithms, this paper proposes the first \underline{L}in\underline{EA}r convergent \underline{D}ecentralized algorithm with compression, LEAD. Our theory describes the coupled dynamics of the inexact primal and dual update as well as compression error, and we provide the first consensus error bound in such settings without assuming bounded gradients. Experiments on convex problems validate our theoretical analysis, and empirical study on deep neural nets shows that LEAD is applicable to non-convex problems.
@article{arxiv.2007.00232,
title = {Linear Convergent Decentralized Optimization with Compression},
author = {Xiaorui Liu and Yao Li and Rongrong Wang and Jiliang Tang and Ming Yan},
journal= {arXiv preprint arXiv:2007.00232},
year = {2021}
}
Comments
ICLR 2021 (International Conference on Learning Representations)