The Lottery Ticket Hypothesis for Pre-trained BERT Networks
원문 초록
In natural language processing (NLP), enormous pre-trained models like BERT have become the standard starting point for training on a range of downstream tasks, and similar trends are emerging in other areas of deep learning. In parallel, work on the lottery ticket hypothesis has shown that models for NLP and computer vision contain smaller matching subnetworks capable of training in isolation to full accuracy and transferring to other tasks. In this work, we combine these observations to assess whether such trainable, transferrable subnetworks exist in pre-trained BERT models. For a range of downstream tasks, we indeed find matching subnetworks at 40% to 90% sparsity. We find these subnetworks at (pre-trained) initialization, a deviation from prior NLP research where they emerge only after some amount of training. Subnetworks found on the masked language modeling task (the same task used to pre-train the model) transfer universally; those found on other tasks transfer in a limited fashion if at all. As large-scale pre-training becomes an increasingly central paradigm in deep learning, our results demonstrate that the main lottery ticket observations remain relevant in this context. Codes available at https://github.com/VITA-Group/BERT-Tickets.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
BMFM-RNA: An Open Framework for Building and Evaluating Transcriptomic Foundation Models
Diffusion Sequence Models for Enhanced Protein Representation and Generation
Masked Language Models are Good Heterogeneous Graph Generalizers
GigaAM: Efficient Self-Supervised Learner for Speech Recognition
GeoRecon: Graph-Level Representation Learning for 3D Molecules via Reconstruction-Based Pretraining
Improving Low-Resource Morphological Inflection via Self-Supervised Objectives
토론
이 논문과 연결된 포럼 글이 아직 없습니다.