mlsanityData to 7 Oct 2026

IntSGD: Adaptive Floatless Compression of Stochastic Gradients

arXiv 2102.08374 ↗First posted 16 Feb 2021cs.LG math.OC stat.MLcited by 8

Not on the map. Why?

Abstract (arXiv)

We propose a family of adaptive integer compression operators for distributed Stochastic Gradient Descent (SGD) that do not communicate a single float. This is achieved by multiplying floating-point vectors with a number known to every device and then rounding to integers. In contrast to the prior work on integer compression for SwitchML by Sapio et al. (2021), our IntSGD method is provably convergent and computationally cheaper as it estimates the scaling of vectors adaptively. Our theory shows that the iteration complexity of IntSGD matches that of SGD up to constant factors for both convex and non-convex, smooth and non-smooth functions, with and without overparameterization. Moreover, our algorithm can also be tailored for the popular all-reduce primitive and shows promising empirical performance.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 22 of its 33 references that are in the map. First posted on arXiv 16 Feb 2021.

Builds on

22 of 33 references.

References · 22

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  4. 2016Densely Connected Convolutional Networkscited by 6,691
  5. 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,479
  6. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 561
  7. 2018Sparsified SGD with Memorycited by 373
  8. 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 306
  9. 2019PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimizationcited by 234
  10. 2019SGD: General Analysis and Improved Ratescited by 206
  11. 2016QSGD: Communication-Efficient SGD via Gradient Quantization and Encodingcited by 147
  12. 2020On Biased Compression for Distributed Learningcited by 140
10 more
  1. 2018ATOMO: Communication-efficient Learning via Atomic Sparsificationcited by 135
  2. 2019Distributed Learning with Compressed Gradient Differencescited by 110
  3. 2019Decentralized Deep Learning with Arbitrary Communication Compressioncited by 109
  4. 2019Natural Compression for Distributed Deep Learningcited by 88
  5. 2020Variance-Reduced Methods for Machine Learningcited by 79
  6. 2016Variance Reduction for Faster Non-Convex Optimizationcited by 72
  7. 2019Don't Jump Through Hoops and Remove Those Loops: SVRG and Katyusha are Better Without the Outer Loopcited by 68
  8. 2019Scaling Distributed Machine Learning with In-Network Aggregationcited by 62
  9. 2018Distributed learning with compressed gradientscited by 53
  10. 2020Uncertainty Principle for Communication Compression in Distributed and Federated Learning and the Search for an Optimal Compressorcited by 45

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 3; 2024: 2; 2025: 1.

8 papers.