Low Precision Decentralized Distributed Training over IID and non-IID Data
Not on the map. Why?
Abstract (arXiv)
Decentralized distributed learning is the key to enabling large-scale machine learning (training) on edge devices utilizing private user-generated local data, without relying on the cloud. However, the practical realization of such on-device training is limited by the communication and compute bottleneck. In this paper, we propose and show the convergence of low precision decentralized training that aims to reduce the computational complexity and communication cost of decentralized training. Many feedback-based compression techniques have been proposed in the literature to reduce communication costs. To the best of our knowledge, there is no work that applies and shows compute efficient training techniques such as quantization, pruning, etc., for peer-to-peer decentralized learning setups. Since real-world applications have a significant skew in the data distribution, we design "Range-EvoNorm" as the normalization activation layer which is better suited for low precision training over non-IID data. Moreover, we show that the proposed low precision training can be used in synergy with other communication compression methods decreasing the communication cost further. Our experiments indicate that 8-bit decentralized training has minimal accuracy loss compared to its full precision counterpart even with non-IID data. However, when low precision training is accompanied by communication compression through sparsification we observe a 1-2% drop in accuracy. The proposed low precision decentralized training decreases computational complexity, memory usage, and communication cost by 4x and compute energy by a factor of ~20x, while trading off less than a 1% accuracy for both IID and non-IID data. In particular, with higher skew values, we observe an increase in accuracy (by ~ 0.5%) with low precision training, indicating the regularization effect of the quantization.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 23 of its 33 references that are in the map. First posted on arXiv 17 Nov 2021.
Builds on
23 of 33 references.
References · 23
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
- 2018Federated Learning with Non-IID Datacited by 1,099
- 2016Federated Optimization: Distributed Machine Learning for On-Device Intelligencecited by 558
- 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 496
- 2017A Brief Survey of Deep Reinforcement Learningcited by 466
- 2019The Non-IID Data Quagmire of Decentralized Machine Learningcited by 303
- 2018SentEval: An Evaluation Toolkit for Universal Sentence Representationscited by 294
- 2019Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communicationcited by 218
11 more
- 2018Stochastic Gradient Push for Distributed Deep Learningcited by 152
- 2018D2: Decentralized Training over Decentralized Datacited by 140
- 2018Scalable Methods for 8-bit Training of Neural Networkscited by 139
- 2019Decentralized Deep Learning with Arbitrary Communication Compressioncited by 109
- 2021Quasi-Global Momentum: Accelerating Decentralized Deep Learning on Heterogeneous Datacited by 69
- 2020Evolving Normalization-Activation Layerscited by 45
- 2021Cross-Gradient Aggregation for Decentralized Learning from Non-IID datacited by 32
- 2020Quantized Decentralized Stochastic Learning over Directed Graphscited by 24
- 2020Moniqua: Modulo Quantized Communication in Decentralized SGDcited by 24
- 2019textttDeepSqueeze: Decentralization Meets Error-Compensated Compressioncited by 21
- 2021Sparse-Push: Communication- & Energy-Efficient Decentralized Distributed Learning over Directed & Time-Varying Graphs with non-IID Datasetscited by 6
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1.
2 papers.