In this article, we propose a communication-efficient decentralized machine learning (ML) algorithm, coined quantized group ADMM (Q-GADMM) . To reduce the number of communication links, every worker in Q-GADMM communicates only with two neighbors, while updating its model via the group alternating direction method of multipliers (GADMM). Moreover, each worker transmits the quantized difference between its current model and its previously quantized model, thereby decreasing the communication payload size. However, due to the lack of centralized entity in decentralized ML, the spatial sparsity and payload compression may incur error propagation, hindering model training convergence. To overcome this, we develop a novel stochastic quantization method to adaptively adjust model quantization levels and their probabilities, while proving the convergence of Q-GADMM for convex objective functions. Furthermore, to demonstrate the feasibility of Q-GADMM for non-convex and stochastic problems, we propose quantized stochastic GADMM (Q-SGADMM) that incorporates deep neural network architectures and stochastic sampling. Simulation results corroborate that Q-GADMM significantly outperforms GADMM in terms of communication efficiency while achieving the same accuracy and convergence speed for a linear regression task. Similarly, for an image classification task using DNN, Q-SGADMM achieves significantly less total communication cost with identical accuracy and convergence speed compared to its counterpart without quantization, i.e., stochastic GADMM (SGADMM).

Elgabli Anis, Park Jihong, Bedi Amrit S., Issaid Chaouki Ben, Bennis Mehdi, Aggarwal Vaneet

Publication type:
A1 Journal article – refereed

Place of publication:

ADMM, Communication-efficient decentralized machine learning, GADMM, stochastic quantization


Full citation:
A. Elgabli, J. Park, A. S. Bedi, C. B. Issaid, M. Bennis and V. Aggarwal, “Q-GADMM: Quantized Group ADMM for Communication Efficient Decentralized Machine Learning,” in IEEE Transactions on Communications, vol. 69, no. 1, pp. 164-181, Jan. 2021, doi: 10.1109/TCOMM.2020.3026398


Read the publication here: