mlsanityData to 7 Oct 2026

Truncated Non-Uniform Quantization for Distributed SGD

arXiv 2402.01160 ↗First posted 2 Feb 2024cs.LG cs.DCcited by 0

Not on the map. Why?

Abstract (arXiv)

To address the communication bottleneck challenge in distributed learning, our work introduces a novel two-stage quantization strategy designed to enhance the communication efficiency of distributed Stochastic Gradient Descent (SGD). The proposed method initially employs truncation to mitigate the impact of long-tail noise, followed by a non-uniform quantization of the post-truncation gradients based on their statistical characteristics. We provide a comprehensive convergence analysis of the quantized distributed SGD, establishing theoretical guarantees for its performance. Furthermore, by minimizing the convergence error, we derive optimal closed-form solutions for the truncation threshold and non-uniform quantization levels under given communication constraints. Both theoretical insights and extensive experimental evaluations demonstrate that our proposed algorithm outperforms existing quantization schemes, striking a superior balance between communication efficiency and convergence performance.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 3 of its 17 references that are in the map. First posted on arXiv 2 Feb 2024.

Builds on

3 of 17 references.

References · 3

  1. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
  2. 2017TernGrad: Ternary Gradients to Reduce Communication in Distributed Deep Learningcited by 253
  3. 2022Quantizing Heavy-tailed Data in Statistical Estimation: (Near) Minimax Rates, Covariate Quantization, and Uniform Recoverycited by 7

Built on by

Not cited yet.