mlsanityData to 7 Oct 2026

RCD-SGD: Resource-Constrained Distributed SGD in Heterogeneous Environment via Submodular Partitioning

arXiv 2211.00839 ↗First posted 2 Nov 2022cs.LG cs.DCcited by 1

Not on the map. Why?

Abstract (arXiv)

The convergence of SGD based distributed training algorithms is tied to the data distribution across workers. Standard partitioning techniques try to achieve equal-sized partitions with per-class population distribution in proportion to the total dataset. Partitions having the same overall population size or even the same number of samples per class may still have Non-IID distribution in the feature space. In heterogeneous computing environments, when devices have different computing capabilities, even-sized partitions across devices can lead to the straggler problem in distributed SGD. We develop a framework for distributed SGD in heterogeneous environments based on a novel data partitioning algorithm involving submodular optimization. Our data partitioning algorithm explicitly accounts for resource heterogeneity across workers while achieving similar class-level feature distribution and maintaining class balance. Based on this algorithm, we develop a distributed SGD framework that can accelerate existing SOTA distributed training algorithms by up to 32%.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 13 of its 37 references that are in the map. First posted on arXiv 2 Nov 2022.

Builds on

13 of 37 references.

References · 13

  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. 2016Wide Residual Networkscited by 3,057
  4. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
  5. 2021Efficient Large-Scale Language Model Training on GPU Clusters Using Megatron-LMcited by 621
  6. 2018Local SGD Converges Fast and Communicates Littlecited by 595
  7. 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 496
  8. 2017Asynchronous Decentralized Parallel Stochastic Gradient Descentcited by 159
  9. 2019MATCHA: Speeding Up Decentralized SGD via Matching Decomposition Samplingcited by 67
  10. 2019A Decentralized Parallel Algorithm for Training Generative Adversarial Netscited by 43
  11. 2016Gossip training for deep learningcited by 33
  12. 2022Fine-tuning Language Models over Slow Networks using Activation Compression with Guaranteescited by 29
1 more
  1. 2016How to scale distributed deep learning?cited by 16

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.