Efficient Stagewise Pretraining via Progressive Subnetworks
Not on the map. Why?
Abstract (arXiv)
Recent developments in large language models have sparked interest in efficient pretraining methods. Stagewise training approaches to improve efficiency, like gradual stacking and layer dropping (Reddi et al, 2023; Zhang & He, 2020), have recently garnered attention. The prevailing view suggests that stagewise dropping strategies, such as layer dropping, are ineffective, especially when compared to stacking-based approaches. This paper challenges this notion by demonstrating that, with proper design, dropping strategies can be competitive, if not better, than stacking methods. Specifically, we develop a principled stagewise training framework, progressive subnetwork training, which only trains subnetworks within the model and progressively increases the size of subnetworks during training, until it trains the full network. We propose an instantiation of this framework - Random Part Training (RAPTR) - that selects and trains only a random subnetwork (e.g. depth-wise, width-wise) of the network at each step, progressively increasing the size in stages. We show that this approach not only generalizes prior works like layer dropping but also fixes their key issues. Furthermore, we establish a theoretical basis for such approaches and provide justification for (a) increasing complexity of subnetworks in stages, conceptually diverging from prior works on layer dropping, and (b) stability in loss across stage transitions in presence of key modern architecture components like residual connections and layer norms. Through comprehensive experiments, we demonstrate that RAPTR can significantly speed up training of standard benchmarks like BERT and UL2, up to 33% compared to standard training and, surprisingly, also shows better downstream performance on UL2, improving QA tasks and SuperGLUE by 1.5%; thereby, providing evidence of better inductive bias.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 73 of its 92 references that are in the map. First posted on arXiv 8 Feb 2024.
Builds on
73 of 92 references.
References · 73
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2016Layer Normalizationcited by 5,669
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
38 more
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
- 2022Emergent Abilities of Large Language Modelscited by 2,512
- 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,729
- 2018Know What You Don't Know: Unanswerable Questions for SQuADcited by 1,554
- 2021MLP-Mixer: An all-MLP Architecture for Visioncited by 1,446
- 2018On the Spectral Bias of Neural Networkscited by 1,341
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
- 2016Deep Networks with Stochastic Depthcited by 979
- 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 905
- 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 903
- 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 896
- 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 788
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
- 2021Going deeper with Image Transformerscited by 764
- 2018CoQA: A Conversational Question Answering Challengecited by 683
- 2021How to train your ViT? Data, Augmentation, and Regularization in Vision Transformerscited by 569
- 2023Are Emergent Abilities of Large Language Models a Mirage?cited by 523
- 2020TyDi QA: A Benchmark for Information-Seeking Question Answering in Typologically Diverse Languagescited by 488
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 439
- 2023Symbolic Discovery of Optimization Algorithmscited by 434
- 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
- 2021Attention is Not All You Need: Pure Attention Loses Rank Doubly Exponentially with Depthcited by 419
- 2018QuAC : Question Answering in Contextcited by 381
- 2019Frequency Principle: Fourier Analysis Sheds Light on Deep Neural Networkscited by 368
- 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 332
- 2018Stronger generalization bounds for deep nets via a compression approachcited by 307
- 2022UL2: Unifying Language Learning Paradigmscited by 295
- 2020BERT Loses Patience: Fast and Robust Inference with Early Exitcited by 273
- 2023Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-trainingcited by 265
- 2020ReZero is All You Need: Fast Convergence at Large Depthcited by 264
- 2020DynaBERT: Dynamic BERT with Adaptive Width and Depthcited by 251
- 2015Net2Net: Accelerating Learning via Knowledge Transfercited by 250
- 2019SGD on Neural Networks Learns Functions of Increasing Complexitycited by 204
- 2019Fixup Initialization: Residual Learning Without Normalizationcited by 198
- 2019Towards Understanding the Spectral Bias of Deep Learningcited by 174
50 most cited of 73 All 73 (JSON)
Built on by
Citing papers per year: 2024: 2; 2025: 5; 2026: 3.
10 papers.
- 2024Upcycling Large Language Models into Mixture of Expertscited by 49
- 2024LAuReL: Learned Augmented Residual Layercited by 7
- 2025Curriculum-Guided Layer Scaling for Language Model Pretrainingcited by 4
- 2025The Journey Matters: Average Parameter Count over Pre-training Unifies Sparse and Dense Scaling Lawscited by 2
- 2025StagFormer: Time Staggering Transformer Decoding for RunningLayers In Parallelcited by 2
- 2025Efficient Knowledge Distillation via Curriculum Extractioncited by 2
- 2025TwIST: Rigging the Lottery in Transformers with Independent Subnetwork Trainingcited by 1
- 2026Expert Upcycling: Shifting the Compute-Efficient Frontier of Mixture-of-Expertscited by 1
- 2026Staged Depth Training: A Representation Curriculum for PINNscited by 0
- 2026Procedural Core: A Compact Recurrent Initialization for Vision Transformerscited by 0
- 2026Procedural Core: A Compact Recurrent Initialization for Vision Transformers29 Sep 2026
- 2026Staged Depth Training: A Representation Curriculum for PINNs21 Aug 2026
- 2026Expert Upcycling: Shifting the Compute-Efficient Frontier of Mixture-of-Experts21 Apr 2026
- 2025TwIST: Rigging the Lottery in Transformers with Independent Subnetwork Training6 Nov 2025
- 2025Curriculum-Guided Layer Scaling for Language Model Pretraining13 Jun 2025
- 2025Efficient Knowledge Distillation via Curriculum Extraction21 Mar 2025
- 2025StagFormer: Time Staggering Transformer Decoding for RunningLayers In Parallel26 Jan 2025
- 2025The Journey Matters: Average Parameter Count over Pre-training Unifies Sparse and Dense Scaling Laws21 Jan 2025
- 2024LAuReL: Learned Augmented Residual Layer12 Nov 2024
- 2024Upcycling Large Language Models into Mixture of Experts10 Oct 2024