2018/06/20 by Jiaxiang Wu, Wu, Jiaxiang, Weidong Huang +5 · 14 citations
Computer Science · Engineering · #Computer Vision and Pattern Recognition (cs.CV) #Distributed #Distributed and Parallel Computing Systems #FOS: Computer and information sciences #Machine Learning and ELM #Metaheuristic Optimization Algorithms Research #Parallel #Sparse and Compressive Sensing Techniques #Stochastic Gradient Optimization Techniques #and Cluster Computing (cs.DC) #cs.CV #cs.DC
paper · pdf · doi:10.48550/arxiv.1806.08054
Accepted by ICML 2018
arxiv created 2018/06/21 · openalex publication_date 2018/06/21 · arxiv updated 2018/06/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Large-scale distributed optimization is of great importance in various applications. For data-parallel based distributed learning, the inter-node gradient communication often becomes the performance bottleneck. In this paper, we propose the error compensated quantized stochastic gradient descent algorithm to improve the training efficiency. Local gradients are quantized to reduce the communication overhead, and accumulated quantization error is utilized to speed up the convergence. Furthermore, we present theoretical analysis on the convergence behaviour, and demonstrate its advantage over competitors. Extensive experiments indicate that our algorithm can compress gradients by a factor of up to two magnitudes without performance degradation.