| Challenge: | Fine-tuning is the prevalent paradigm for using large pretrained language models for downstream tasks, but it requires updating and storing all the parameters of the LM. |
| Approach: | They propose a lightweight alternative to fine-tuning for natural language generation tasks that optimizes a sequence of continuous vectors, which they call the prefix. |
| Outcome: | The proposed approach outperforms fine-tuning in the full data setting and extrapolates better to examples with topics that are unseen during training. |
Similar Papers
Towards Adaptive Prefix Tuning for Parameter-Efficient Language Model Fine-tuning (2023.acl-short)
Copied to clipboard
| Challenge: | Parameter-efficient fine-tuning only optimizes a few task-specific parameters with frozen pre-trained model. |
| Approach: | They propose to optimize a prefix vector inserted into Transformer layers to optimize the prefix . they propose to use a gate mechanism to adjust the prefixed to each layer . |
| Outcome: | The proposed approach improves on the SuperGLUE and NER datasets. |
Prefix Propagation: Parameter-Efficient Tuning for Long Sequences (2023.acl-short)
Copied to clipboard
| Challenge: | Prefix-tuning prepends trainable tokens to sequences while freezing the rest of the model’s parameters. |
| Approach: | They propose a method that prefixes on previous hidden states to improve model performance. |
| Outcome: | The proposed architecture outperforms prefix-tuning on long-document tasks while using 50% fewer parameters. |
Inducer-tuning: Connecting Prefix-tuning and Adapter-tuning (2022.emnlp-main)
Copied to clipboard
| Challenge: | Prefix-tuning is an essential paradigm of parameter-efficient transfer learning . fine-tuned models require separate copies of model parameters for each task . |
| Approach: | They propose to understand and further develop prefix-tuning through the kernel lens . they propose a new variant of prefix tuning that shares the exact mechanism as prefix tun . |
| Outcome: | The proposed method improves prefix-tuning performance by training only a small portion of parameters. |
Selective Prefix Tuning for Pre-trained Language Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for fine-tuning pre-trained models are time-consuming and memory-inefficient. |
| Approach: | They propose a method that inserts learnable vectors into each Transformer layer . they propose SL to encourage diversity in prefix tokens . |
| Outcome: | Extensive experiments validate the effectiveness of Prefix Tuning in sentence and token classification tasks. |
Context-Tuning: Learning Contextualized Prompts for Natural Language Generation (2022.coling-1)
Copied to clipboard
| Challenge: | Recent studies have shown that pretrained language models (PLMs) lack sufficient consideration of input semantics to generate natural language. |
| Approach: | They propose a continuous prompting approach to fine-tune PLMs for natural language generation by modeling an inverse generation process from output to input. |
| Outcome: | The proposed method fine-tunes only 0.12% of the parameters while maintaining good performance. |
CodePrompt: Task-Agnostic Prefix Tuning for Program and Language Generation (2023.findings-acl)
Copied to clipboard
| Challenge: | Prompt-tuning methods have been used to solve inefficient parameter update and storage issues in Natural Language Generation tasks. |
| Approach: | They propose a task-agnostic prompt tuning method that reflects the traits of PLM for program language. |
| Outcome: | The proposed method is effective in three PLG tasks, not only in the full-data setting but also in the low-resource setting and cross-domain setting. |
The Power of Scale for Parameter-Efficient Prompt Tuning (2021.emnlp-main)
Copied to clipboard
| Challenge: | Unlike discrete text prompts used by GPT-3, soft prompts are learned through backpropagation and can be tuned to incorporate signals from any number of labeled examples. |
| Approach: | They propose a mechanism for learning "soft prompts" to condition frozen language models to perform specific downstream tasks. |
| Outcome: | The proposed method outperforms fewshot learning using GPT-3 and matches the quality of model tuning as models exceed billions of parameters. |
Modular and Parameter-Efficient Fine-Tuning for NLP Models (2022.emnlp-tutorials)
Copied to clipboard
| Challenge: | State-of-the-art language models in NLP perform best when fine-tuned even on small datasets. |
| Approach: | They provide an overview of parameter-efficient fine-tuning methods and highlight similarities and differences . they highlight benefits and usage scenarios of a neglected property of parameter efficient models . |
| Outcome: | This paper provides an overview of parameter-efficient fine-tuning methods . it highlights similarities and differences by presenting them in a unified view . |
Learning Easily Updated General Purpose Text Representations with Adaptable Task-Specific Prefix (2023.findings-emnlp)
Copied to clipboard
| Challenge: | a large pre-trained language model can cause computational burdens in inference time due to multiple forward passes. |
| Approach: | They propose a method to learn fixed text representations with source tasks . they learn a task-specific prefix for each source task independently and combine them . |
| Outcome: | The proposed method improves generalizability of representations with source tasks. |
Discourse-Aware Soft Prompting for Text Generation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in pre-trained langauge models (PLMs) have made great impact on text generation research. |
| Approach: | They propose to use hierarchical blocking to simulate a higher-level discourse structure of human written text and attention sparsity to learn sparse transformations on the softmax-function. |
| Outcome: | The proposed methods perform better on some generation tasks but don't generalize across all generation tasks. |