Pith

open record

sign in

arxiv: 2410.06511 · v3 · pith:YXYZUDTE · submitted 2024-10-09 · cs.CL · cs.AI· cs.DC· cs.LG

TorchTitan: One-stop PyTorch native solution for production ready LLM pre-training

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:YXYZUDTErecord.jsonopen to challenge →

classification cs.CL cs.AIcs.DCcs.LG
keywords trainingllamatorchtitanparallelismscalellmsstate-of-the-arttechniques
0
0 comments X
read the original abstract

The development of large language models (LLMs) has been instrumental in advancing state-of-the-art natural language processing applications. Training LLMs with billions of parameters and trillions of tokens require sophisticated distributed systems that enable composing and comparing several state-of-the-art techniques in order to efficiently scale across thousands of accelerators. However, existing solutions are complex, scattered across multiple libraries/repositories, lack interoperability, and are cumbersome to maintain. Thus, curating and empirically comparing training recipes require non-trivial engineering effort. This paper introduces TorchTitan, an open-source, PyTorch-native distributed training system that unifies state-of-the-art techniques, streamlining integration and reducing overhead. TorchTitan enables 3D parallelism in a modular manner with elastic scaling, providing comprehensive logging, checkpointing, and debugging tools for production-ready training. It also incorporates hardware-software co-designed solutions, leveraging features like Float8 training and SymmetricMemory. As a flexible test bed, TorchTitan facilitates custom recipe curation and comparison, allowing us to develop optimized training recipes for Llama 3.1 and provide guidance on selecting techniques for maximum efficiency based on our experiences. We thoroughly assess TorchTitan on the Llama 3.1 family of LLMs, spanning 8 billion to 405 billion parameters, and showcase its exceptional performance, modular composability, and elastic scalability. By stacking training optimizations, we demonstrate accelerations of 65.08% with 1D parallelism at the 128-GPU scale (Llama 3.1 8B), an additional 12.59% with 2D parallelism at the 256-GPU scale (Llama 3.1 70B), and an additional 30% with 3D parallelism at the 512-GPU scale (Llama 3.1 405B) on NVIDIA H100 GPUs over optimized baselines.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 16 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. CODA: Rewriting Transformer Blocks as GEMM-Epilogue Programs

    cs.LG 2026-05 unverdicted novelty 7.0

    CODA re-expresses most non-attention Transformer computations as GEMM-plus-epilogue programs using a constrained set of composable primitives to keep intermediate results on-chip and cut global memory traffic.

  2. CODA: Rewriting Transformer Blocks as GEMM-Epilogue Programs

    cs.LG 2026-05 unverdicted novelty 7.0

    CODA re-expresses non-attention Transformer computations as GEMM epilogues using composable primitives for scaling, reductions, and transformations.

  3. CCL-Bench 1.0: A Trace-Based Benchmark for LLM Infrastructure

    cs.DC 2026-05 unverdicted novelty 7.0

    CCL-Bench packages traces and metadata to compute detailed compute, memory, and communication efficiency metrics, surfacing performance insights unavailable from end-to-end benchmarks.

  4. MatrixFSDP: communication-free matrix optimizers under ZeRO-3 parameter sharding

    cs.DC 2026-07 conditional novelty 6.0

    MatrixFSDP places whole 2D weight matrices on single ZeRO-3 owner ranks so matrix optimizers run locally without optimizer-step collectives, preserving ZeRO-3 memory while achieving up to 54.6x optimizer-step speedup ...

  5. LoKA: Low-precision Kernel Applications for Recommendation Models At Scale

    cs.LG 2026-05 unverdicted novelty 6.0

    LoKA enables practical FP8 use in numerically sensitive large recommendation models via profiling, model adaptations, and runtime kernel orchestration.

  6. LoKA: Low-precision Kernel Applications for Recommendation Models At Scale

    cs.LG 2026-05 unverdicted novelty 6.0

    LoKA enables practical FP8 use in numerically sensitive large recommendation models via online profiling of activations, reusable model modifications for stability, and dynamic kernel dispatching.

  7. Decoupling the Benefits of Subword Tokenization for Language Model Training via Byte-level Simulation

    cs.CL 2026-04 unverdicted novelty 6.0

    Byte-level simulations show subword tokenization improves LLM training mainly via increased throughput and boundary priors.

  8. BOOST: BOttleneck-Optimized Scalable Training Framework for Low-Rank Large Language Models

    cs.LG 2025-12 unverdicted novelty 6.0

    BOOST delivers 1.46-2.27x end-to-end speedups for low-rank bottleneck LLMs by redesigning tensor parallelism around the bottleneck structure plus supporting optimizations.

  9. FLUX.1 Kontext: Flow Matching for In-Context Image Generation and Editing in Latent Space

    cs.GR 2025-06 unverdicted novelty 6.0

    FLUX.1 Kontext unifies image generation and editing via flow matching and sequence concatenation, delivering improved multi-turn consistency and speed on the new KontextBench benchmark.

  10. MAGI-1: Autoregressive Video Generation at Scale

    cs.CV 2025-05 unverdicted novelty 6.0

    MAGI-1 is a 24B-parameter autoregressive video world model that predicts denoised frame chunks sequentially with increasing noise to enable causal, scalable, streaming generation up to 4M token contexts.

  11. Mixture-of-Parallelisms: Towards Memory-Efficient Training Stack for Mixture-of-Experts Models

    cs.DC 2026-07 unverdicted novelty 5.0

    MoP combines specialized parallelisms and a new optimizer step for memory-efficient MoE training, delivering 4.7x-8.2x higher per-GPU throughput than FSDP2 while supporting 1M-token contexts on 12 8x H200 nodes.

  12. DynaFlow: Transparent and Flexible Intra-Device Parallelism via Programmable Operator Scheduling

    cs.DC 2026-05 unverdicted novelty 5.0

    DynaFlow enables transparent intra-device parallelism in ML systems by separating model definition from execution scheduling, integrating into 6 frameworks with up to 1.29x throughput gains and minimal code changes.

  13. Decoupling the Benefits of Subword Tokenization for Language Model Training via Byte-level Simulation

    cs.CL 2026-04 unverdicted novelty 5.0

    Subword tokenization's main benefits arise from higher sample throughput and the use of subword boundaries as explicit priors or inductive biases, isolated via controlled byte-level simulations.

  14. UniEP: Unified Expert-Parallel MoE MegaKernel for LLM Training

    cs.DC 2026-04 unverdicted novelty 5.0

    UniEP fuses MoE communication and computation into unified MegaKernels with deterministic token ordering, delivering 1.03x-1.38x speedups over prior work while preserving training accuracy.

  15. Flint: Compiler Enabled Cluster-Free Design Space Exploration for Distributed ML

    cs.DC 2026-04 unverdicted novelty 5.0

    Flint generates compiler-derived workload graphs that support cluster-free design space exploration for distributed machine learning systems.

  16. DMuon: Efficient Distributed Muon Training with Near-Adam Overhead

    cs.DC 2026-06 unverdicted novelty 4.0

    DMuon delivers 1.48x-3.01x end-to-end and 6.85x-163x optimizer-step speedups for Muon on embodied foundation models and LLMs while matching AdamW per-step latency.