REVIEW 3 cited by
ZeRO-Offload: Democratizing Billion-Scale Model Training
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
read the original abstract
Large-scale model training has been a playing ground for a limited few requiring complex model refactoring and access to prohibitively expensive GPU clusters. ZeRO-Offload changes the large model training landscape by making large model training accessible to nearly everyone. It can train models with over 13 billion parameters on a single GPU, a 10x increase in size compared to popular framework such as PyTorch, and it does so without requiring any model change from the data scientists or sacrificing computational efficiency. ZeRO-Offload enables large model training by offloading data and compute to CPU. To preserve compute efficiency, it is designed to minimize the data movement to/from GPU, and reduce CPU compute time while maximizing memory savings on GPU. As a result, ZeRO-Offload can achieve 40 TFlops/GPU on a single NVIDIA V100 GPU for 10B parameter model compared to 30TF using PyTorch alone for a 1.4B parameter model, the largest that can be trained without running out of memory. ZeRO-Offload is also designed to scale on multiple-GPUs when available, offering near linear speedup on up to 128 GPUs. Additionally, it can work together with model parallelism to train models with over 70 billion parameters on a single DGX-2 box, a 4.5x increase in model size compared to using model parallelism alone. By combining compute and memory efficiency with ease-of-use, ZeRO-Offload democratizes large-scale model training making it accessible to even data scientists with access to just a single GPU.
Forward citations
Cited by 3 Pith papers
-
Steering the Noise: Turning Random Perturbations into Effective Descent for Memory-Efficient LLM Fine-Tuning
Selecting or combining the lowest-loss random perturbations before each update makes zeroth-order LLM fine-tuning converge faster, reportedly beating gradient-based fine-tuning on 9 of 11 tasks at a fraction of the memory.
-
Meta-Learning for Speeding Up Large Model Inference in Decentralized Environments
MetaInf, an XGBoost meta-scheduler with LLM-derived embeddings, selects inference acceleration strategies with reported 89.8% accuracy and 1.55x average acceleration, beating baselines.
-
StreamBP: Memory-Efficient Exact Backpropagation for Long Sequence Training of LLMs
StreamBP partitions backpropagation over the sequence dimension to compute exact gradients with much lower activation memory, extending maximum trainable sequence length by roughly 3-5x over gradient checkpointing.
Discussion (0). Continue with ORCID to comment.