Challenge: Prompt tuning has been proven to be successful on various tasks by incorporating a small number of trainable parameters while freezing large pre-trained language models.
Approach: They propose a token-wise prompt tuning method that uses a bank of finer-grained soft prompt tokens to generate an instance-dependent prompt.
Outcome: The proposed method performs far better than full parameter fine-tuned models and achieves state-of-the-art by tuning only 0.035% parameters on 14 datasets.

Similar Papers

Bayesian Multi-Task Transfer Learning for Soft Prompt Tuning (2023.findings-emnlp)

Copied to clipboard

Challenge: Large-scale pre-trained language models have been fine-tuned for various NLP tasks . prompt tuning is a method that optimizes the output of the model to adapt to downstream tasks based on the posterior distribution of the source task.
Approach: They propose a Bayesian approach to prompt tuning that optimizes for adapting pre-trained language models to downstream tasks rather than fine-tuning full model parameters.
Outcome: The proposed approach outperforms the state-of-the-art methods on benchmark NLP tasks.
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.
FPT: Improving Prompt Tuning Efficiency via Progressive Training (2022.findings-emnlp)

Copied to clipboard

Challenge: Recent prompt tuning (PT) has gained increasing attention as a parameter-efficient way of tuning pre-trained language models (PLMs).
Approach: They propose a prompt tuning algorithm that uses a small-scale partial PLM and progressively expands its depth and width until the full-model size.
Outcome: The proposed method could save over 30% of training computations while achieving comparable performance.
On Transferability of Prompt Tuning for Natural Language Processing (2022.naacl-main)

Copied to clipboard

Challenge: Pre-trained language models (PLMs) can achieve comparable performance to full-parameter fine-tuning by tuning a few soft prompts, but require much more training time than fine-timing.
Approach: They empirically investigate the transferability of soft prompts across different downstream tasks and PLMs to determine what decides prompt transferability.
Outcome: The proposed method can achieve comparable performance to full-parameter fine-tuning by tuning a few soft prompts, but requires much more training time than fine-timing.
ATTEMPT: Parameter-Efficient Multi-task Tuning via Attentional Mixtures of Soft Prompts (2022.emnlp-main)

Copied to clipboard

Challenge: a new multi-task, parameter-efficient language model tuning method learns to transfer knowledge across different tasks via a mixture of soft prompts.
Approach: They propose a multi-task, parameter-efficient language model tuning method that uses soft prompts to learn to transfer knowledge across different tasks.
Outcome: The proposed method outperforms prompt tuning and outperfies or matches fully fine-tuned tuning approaches that use 10 times more parameters.
IAPT: Instance-Aware Prompt Tuning for Large Language Models (2024.acl-long)

Copied to clipboard

Challenge: Existing methods for prompt tuning require many soft tokens to guarantee performance . large language models still require a large amount of GPU memory and computations to fine-tune .
Approach: They propose to use a parameter-efficient soft prompt generator to generate idiosyncratic soft prompts for each input instruction.
Outcome: The proposed method outperforms the baselines with comparable tunable parameters and is more efficient than LoRA under the single-backbone multi-tenant setting.
PPT: Pre-trained Prompt Tuning for Few-shot Learning (2022.acl-long)

Copied to clipboard

Challenge: Prompt tuning for pre-trained language models has shown remarkable performance . however, prompt tuning is still not fully explored .
Approach: They propose to pre-train prompts by adding soft prompts into the pre-training stage to obtain a better initialization.
Outcome: The proposed framework outperforms full-model tuning under full-data and few-shot learning settings.
Hard Sample Aware Prompt-Tuning (2023.acl-long)

Copied to clipboard

Challenge: Prompt-tuning based few-shot learning has garnered increasing attention in recent years due to its efficiency and promising capability.
Approach: They propose a framework to distinguish informative hard samples from misleading ones in model training.
Outcome: The proposed framework achieves new SOTA results on a series of NLP tasks pushing the SST-5 accuracy to 49.5% (1.1% point absolute improvement), QNLI accuracy to 74.6% (1.9% absolute improvement)
Parameter-Efficient Prompt Tuning Makes Generalized and Calibrated Neural Text Retrievers (2023.findings-emnlp)

Copied to clipboard

Challenge: Prompt tuning is a technique that updates few parameters in pre-trained models for language understanding and generation tasks.
Approach: They propose to leverage prompt tuning for neural text retrieval to improve generalization and cross-domain generalization.
Outcome: The proposed approach can mitigate the two issues faced by fine-tuning retrieval methods and improve the out-of-domain zero-shot generalization of the retrieval models.
StablePT : Towards Stable Prompting for Few-shot Learning via Input Separation (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing studies on prompt tuning have shown that language models can be effective few-shot learners with prompting.
Approach: They propose to treat the hard prompt and soft prompt as separate inputs to mitigate noise brought by prompt initialization.
Outcome: Experimental results show that the proposed method outperforms state-of-the-art methods by 6.97% in accuracy and reduces the standard deviation by 1.92 on average.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations