Scaling Pre-trained Language Models to Deeper via Parameter-efficient Architecture
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose a highly parameter-efficient approach to scaling pre-trained language models (PLMs) to a deeper model depth. Unlike prior work that shares all parameters or uses extra blocks, we design a more capable parameter-sharing architecture based on matrix product operator (MPO). MPO decomposition can reorganize and factorize the information of a parameter matrix into two parts: the major part that contains the major information (central tensor) and the supplementary part that only has a small proportion of parameters (auxiliary tensors). Based on such a decomposition, our architecture shares the central tensor across all layers for reducing the model size and meanwhile keeps layer-specific auxiliary tensors (also using adapters) for enhancing the adaptation flexibility. To improve the model training, we further propose a stable initialization algorithm tailored for the MPO-based architecture. Extensive experiments have demonstrated the effectiveness of our proposed model in reducing the model size and achieving highly competitive performance.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 32 of its 37 references that are in the map. First posted on arXiv 27 Mar 2023.
Builds on
32 of 37 references.
References · 32
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
- 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
- 2015Aligning Books and Movies: Towards Story-like Visual Explanations by Watching Movies and Reading Bookscited by 1,041
- 2019Are Sixteen Heads Really Better than One?cited by 803
20 more
- 2019Large Batch Optimization for Deep Learning: Training BERT in 76 minutescited by 671
- 2020MobileBERT: a Compact Task-Agnostic BERT for Resource-Limited Devicescited by 476
- 2019What do you learn from context? Probing for sentence structure in contextualized word representationscited by 436
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2015Tensorizing Neural Networkscited by 246
- 2020FastBERT: a Self-distilling BERT with Adaptive Inference Timecited by 224
- 2019Structured Pruning of Large Language Modelscited by 201
- 2019Fixup Initialization: Residual Learning Without Normalizationcited by 194
- 2022DeepNet: Scaling Transformers to 1,000 Layerscited by 176
- 2022MiniViT: Compressing Vision Transformers with Weight Multiplexingcited by 88
- 2016Ultimate tensorization: compressing convolutional and FC layers alikecited by 55
- 2021Subformer: Exploring Weight Sharing for Parameter Efficiency in Generative Transformerscited by 42
- 2017Long-term Forecasting using Higher Order Tensor RNNscited by 34
- 2022Parameter-Efficient Mixture-of-Experts Architecture for Pre-trained Language Modelscited by 31
- 2021Enabling Lightweight Fine-tuning for Pre-trained Language Model Compression based on Matrix Product Operatorscited by 28
- 2019Compressing deep neural networks by matrix product operatorscited by 27
- 2020A Model Compression Method with Matrix Product Operators for Speech Enhancementcited by 9
- 2022Clues Before Answers: Generation-Enhanced Multiple-Choice QAcited by 9
- 2022MiniALBERT: Model Distillation via Parameter-Efficient Recursive Transformerscited by 5
- 2020Compressing LSTM Networks by Matrix Product Operatorscited by 3
Built on by
Not cited yet.