M22: A Communication-Efficient Algorithm for Federated Learning Inspired by Rate-Distortion

IEEE TRANSACTIONS ON COMMUNICATIONS(2024)

引用 0|浏览5
暂无评分
摘要
In federated learning (FL), the communication constraint between the remote clients and the Parameter Server (PS) is a crucial bottleneck. For this reason, model updates must be compressed so as to minimize the loss in accuracy resulting from the communication constraint. This paper proposes "M-magnitude weighted L2 distortion + 2 degrees of freedom" (M22) algorithm, a rate-distortion inspired approach to gradient compression for federated training of deep neural networks (DNNs). In particular, we propose a family of distortion measures between the original gradient and the reconstruction we referred to as " $M$ -magnitude weighted $L_{2}$ " distortion, and we assume that gradient updates follow an i.i.d. distribution - generalized normal or Weibull, which have two degrees of freedom. In both the distortion measure and the gradient distribution, there is one free parameter for each that can be fitted as a function of the iteration number. Given a choice of gradient distribution and distortion measure, we design the quantizer to minimize the expected distortion in gradient reconstruction. To measure the gradient compression performance under a communication constraint, we define the per-bit accuracy as the optimal improvement in accuracy that one bit of communication brings to the centralized model over the training period. Using this performance measure, we systematically benchmark the choice of gradient distribution and distortion measure. We provide substantial insights on the role of these choices and argue that significant performance improvements can be attained using such a rate-distortion inspired compressor.
更多
查看译文
关键词
Distortion,Training,Distortion measurement,Quantization (signal),Rate-distortion,Federated learning,Compression algorithms,gradient compression,gradient quantization,gradient sparsification,DNN gradient modeling
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要