Kronecker Decomposition for GPT Compression

5Citations
Citations of this article
58Readers
Mendeley users who have this article in their library.

Abstract

GPT is an auto-regressive Transformer-based pre-trained language model which has attracted a lot of attention in the natural language processing (NLP) domain. The success of GPT is mostly attributed to its pre-training on huge amount of data and its large number of parameters. Despite the superior performance of GPT, this overparameterized nature of GPT can be very prohibitive for deploying this model on devices with limited computational power or memory. This problem can be mitigated using model compression techniques; however, compressing GPT models has not been investigated much in the literature. In this work, we use Kronecker decomposition to compress the linear mappings of the GPT-2 model. Our Kronecker GPT-2 model (KnGPT2) is initialized based on the Kronecker decomposed version of the GPT-2 model and then is undergone a very light pretraining on only a small portion of the training data with intermediate layer knowledge distillation (ILKD). Finally, our KnGPT2 is fine-tuned on downstream tasks using ILKD as well. We evaluate our model on both language modeling and General Language Understanding Evaluation benchmark tasks and show that with more efficient pre-training and similar number of parameters, our KnGPT2 outperforms the existing DistilGPT2 model significantly.

Cite

CITATION STYLE

APA

Edalati, A., Tahaei, M., Rashid, A., Nia, V. P., Clark, J. J., & Rezagholizadeh, M. (2022). Kronecker Decomposition for GPT Compression. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 2, pp. 219–226). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2022.acl-short.24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free