paper-with-me

Papers

Efficient Stagewise Pretraining via Progressive Subnetworks

2024-02-08 · Abhishek Panigrahi, Nikunj Saunshi, Kaifeng Lyu, Sobhan Miryoosefi, Sashank Reddi, Satyen Kale, Sanjiv Kumar

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.

📄 PDF Abstract BibTeX arXiv:2402.05913

Code (0)

등록된 구현이 없습니다.

Tasks

Inductive Bias

Methods 이 논문이 사용한 방법론

Refunds@Expedia|||How do I get a full refund from Expedia? “How do I get a full refund from Expedia? How do I get a full refund from Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Quick Help &…
Attention 설명 없음
SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Multi-Head Attention 설명 없음
Attention Dropout Attention Dropout is a type of dropout used in attention-based architectures, where elements are randomly dropped out of the…
Residual Connection 설명 없음
Adam 설명 없음

Similar Papers 제목 키워드 기반

Influence Dynamics and Stagewise Data Attribution

2025-10-14 · Jin Hwa Lee, Matthew Smith, Maxwell Adam, Jesse Hoogland arxiv

Current training data attribution (TDA) methods treat the influence one sample has on another as static, but neural networks learn in distinct stages that exhibit changing patterns of influence. In this work, we introduc…

Data Efficient Stagewise Knowledge Distillation

2019-11-15 · Akshay Kulkarni, Navid Panchi, Sharath Chandra Raparthy, Shital Chiddarwar

Despite the success of Deep Learning (DL), the deployment of modern DL models requiring large computational power poses a significant problem for resource-constrained systems. This necessitates building compact networks …

Knowledge DistillationModel CompressionQuantizationSemantic Segmentation

A General Framework for Fast Stagewise Algorithms

2014-08-25 · Ryan J. Tibshirani

Forward stagewise regression follows a very simple strategy for constructing a sequence of sparse regression estimates: it starts with all coefficients equal to zero, and iteratively updates the coefficient (by a small a…

DenoisingImage DenoisingMatrix Completionregression

Universal Stagewise Learning for Non-Convex Problems with Convergence on Averaged Solutions

2018-08-20 · ICLR 2019 5 · Zaiyi Chen, Zhuoning Yuan, Jin-Feng Yi, Bo-Wen Zhou 외

Although stochastic gradient descent (SGD) method and its variants (e.g., stochastic momentum methods, AdaGrad) are the choice of algorithms for solving non-convex problems (especially deep learning), there still remain …

Self-Distillation Improves DNA Sequence Inference

2024-05-14 · Tong Yu, Lei Cheng, Ruslan Khalitov, Erland Brandser Olsson 외

Self-supervised pretraining (SSP) has been recognized as a method to enhance prediction accuracy in various downstream tasks. However, its efficacy for DNA sequences remains somewhat constrained. This limitation stems pr…

Contrastive LearningLanguage ModelingLanguage ModellingMasked Language Modeling