REVIEW 2 cited by
Modern Distributed Data-Parallel Large-Scale Pre-training Strategies For NLP models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Distributed deep learning is becoming increasingly popular due to the expanding demand for computing resources for deep learning models with a larger amount of parameters. Different from traditional training approaches, data-parallel training allows multiple compute nodes to train large deep learning models simultaneously in order to boost the training efficiency. In this paper, we present and compare six strategies for data-parallel training using PyTorch on the language model GPT-2 with 100M parameters using a qualitative approach. These strategies are Single GPU, Single Parameter Server, Distributed Parameter Server, Horovod, Distributed Parameter Server with Apex mixed-precision strategy, and Horovod with Apex mixed-precision strategy. We also analyze the quantitative experiment results from each strategy. In the end, we draw the conclusion that the Distributed Parameter Server with Apex mixedprecision strategy has the best performance on single node training, while Horovod with Apex is the most robust approach to use when we have single or multiple nodes.
Forward citations
Cited by 2 Pith papers
-
Bi-semantic Chemical Embedder for Joint Representation Learning of SMILES and Natural Language
A ModernBERT-based encoder trained with masked language modeling on SMILES-annotated scientific documents plus a contrastive stage yields embeddings that are competitive on both molecular property prediction and scien...
-
Parameter-Efficient Checkpoint Merging via Metrics-Weighted Averaging
Merging LoRA checkpoints with weights based on inverse training loss, plus a rank-based penalty, beats uniform averaging on three fine-tuning tasks.
Discussion (0). Continue with ORCID to comment.