Parameter-Efficient Tuning by Manipulating Hidden States of Pretrained Language Models For Classification Tasks
Not on the map. Why?
Abstract (arXiv)
Parameter-efficient tuning aims to distill knowledge for downstream tasks by optimizing a few introduced parameters while freezing the pretrained language models (PLMs). Continuous prompt tuning which prepends a few trainable vectors to the embeddings of input is one of these methods and has drawn much attention due to its effectiveness and efficiency. This family of methods can be illustrated as exerting nonlinear transformations of hidden states inside PLMs. However, a natural question is ignored: can the hidden states be directly used for classification without changing them? In this paper, we aim to answer this question by proposing a simple tuning method which only introduces three trainable vectors. Firstly, we integrate all layers hidden states using the introduced vectors. And then, we input the integrated hidden state(s) to a task-specific linear classifier to predict categories. This scheme is similar to the way ELMo utilises hidden states except that they feed the hidden states to LSTM-based models. Although our proposed tuning scheme is simple, it achieves comparable performance with prompt tuning methods like P-tuning and P-tuning v2, verifying that original hidden states do contain useful information for classification tasks. Moreover, our method has an advantage over prompt tuning in terms of time and the number of parameters.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 29 of its 37 references that are in the map. First posted on arXiv 10 Apr 2022.
Builds on
29 of 37 references.
References · 29
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
- 2018Deep contextualized word representationscited by 2,290
- 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,234
- 2019Language Models as Knowledge Bases?cited by 1,936
17 more
- 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,729
- 2020Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inferencecited by 938
- 2019Plug and Play Language Models: A Simple Approach to Controlled Text Generationcited by 799
- 2019How Contextual are Contextualized Word Representations? Comparing the Geometry of BERT, ELMo, and GPT-2 Embeddingscited by 784
- 2021P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Taskscited by 689
- 2020Pre-trained Models for Natural Language Processing: A Surveycited by 505
- 2020MAD-X: An Adapter-Based Framework for Multi-Task Cross-Lingual Transfercited by 445
- 2020AdapterHub: A Framework for Adapting Transformerscited by 444
- 2019Multi-Task Deep Neural Networks for Natural Language Understandingcited by 350
- 2022Black-Box Tuning for Language-Model-as-a-Servicecited by 256
- 2020Continual Lifelong Learning in Natural Language Processing: A Surveycited by 152
- 2019Open Sesame: Getting Inside BERT's Linguistic Knowledgecited by 120
- 2019A Survey on Recent Advances in Named Entity Recognition from Deep Learning modelscited by 117
- 2020Masking as an Efficient Alternative to Finetuning for Pretrained Language Modelscited by 93
- 2021Is Attention Better Than Matrix Decomposition?cited by 77
- 2015Learning Natural Language Inference with LSTMcited by 51
- 2019Can Unconditional Language Models Recover Arbitrary Sentences?cited by 15
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1.
2 papers.