Simulating fault tolerance with stage skipping in pipeline-parallel training [R]
Summary
This article explores fault tolerance in distributed pre-training by simulating stage skipping in pipeline-parallel training, demonstrating that healthy workers can continue training with minimal validation loss impact when failures occur.
Similar Articles
Breaking the Bubble: Asynchronous Pipeline Parallel Training with Bounded Weight Inconsistency
Introduces PACI, a bubble-free asynchronous pipeline parallel training method that bounds forward/backward weight inconsistency using local gradient accumulation, achieving higher throughput and faster time-to-accuracy without sacrificing stability or memory usage.
One-Step Gradient Delay is Not a Barrier for Large-Scale Asynchronous Pipeline Parallel LLM Pretraining
This paper challenges the assumption that one-step gradient delay in asynchronous pipeline parallelism is inherently unstable, showing that degradation depends on optimizer choice. It demonstrates that optimizers like Muon are robust to one-step delay and introduces an error-feedback correction to further mitigate staleness, achieving near-synchronous performance in LLM pretraining up to 10B parameters.
DeadPool: Resilient LLM Training with Hot-Swapping via Zero-Overhead Checkpoint
DeadPool introduces a fault-tolerance mechanism for LLM training that enables hot-swapping of failed nodes with spare nodes using zero-overhead in-memory checkpointing, achieving fast recovery without interrupting the job.
Notes on pretraining parallelisms and failed training runs (12 minute read)
A technical deep-dive into common causes of failed pretraining runs in large language models, including causality-breaking issues in expert routing and numerical precision bugs, with examples from Llama 4, Gemini 2 Pro, and GPT-4.
DynaTrain: Fast Online Parallelism Switching for Elastic LLM Training
DynaTrain is a distributed training system enabling sub-second online reconfiguration of parallelism for large language models, using a Virtual Parameter Space abstraction to achieve up to three orders of magnitude faster transitions than existing methods.