Challenge: Prompt tuning has emerged as a successful parameter-efficient alternative to the full fine-tuning of language models.
Approach: They propose a prompt tuning method that utilizes short soft prompts for efficient training and inference while maintaining performance gains typically induced by longer soft prompt.
Outcome: The proposed method outperforms baseline methods while preserving memory usage.

Similar Papers

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.
Residual Prompt Tuning: improving prompt tuning with residual reparameterization (2023.findings-acl)

Copied to clipboard

Challenge: Prompt tuning is one of the most parameter-efficient approaches for parameter-effective tuning of pre-trained language models.
Approach: They propose to reparameterize soft prompt embeddings using a shallow network with a residual connection and use it to tune prompt embeds P.
Outcome: The proposed method outperforms prompt tuning on SuperGLUE, T5-Base and BERT-Bass models and can reduce the prompt length by 10 times without hurting performance.
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.
Late Prompt Tuning: A Late Prompt Could Be Better Than Many Prompts (2022.findings-emnlp)

Copied to clipboard

Challenge: Prompt tuning is parameter-efficient but lags behind other state-of-the-art methods.
Approach: They propose a parameter-efficient tuning method that only optimizes a soft prompt to adapt PTMs to downstream tasks.
Outcome: The proposed method is parameter-efficient but lags behind other state-of-the-art methods.
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.
Efficient and Effective Prompt Tuning via Prompt Decomposition and Compressed Outer Product (2025.naacl-long)

Copied to clipboard

Challenge: Existing methods for fine-tuning pre-trained language models overlook intrinsic semantic associations between soft prompt tokens, leading to high discreteness and limited interactions.
Approach: They propose a low-parameters Prompt Tuning method which leverages prompt decomposition and compressed outer product to facilitate multiple interactions among prompt tokens.
Outcome: Experiments on six architectures and eight datasets show that the proposed method outperforms state-of-the-art methods in performance and efficiency.
PAFT: Prompt-Agnostic Fine-Tuning (2025.emnlp-main)

Copied to clipboard

Challenge: Prompt-agnostic fine-tuning (PAFT) improves performance by reducing overfitting to specific prompts.
Approach: They propose a method that enhances robustness through dynamic prompt variation during training.
Outcome: The proposed method achieves higher generalization accuracy on unseen prompts than standard methods with similar training efficiency.
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.
Hard Prompts Made Interpretable: Sparse Entropy Regularization for Prompt Tuning with RL (2024.acl-long)

Copied to clipboard

Challenge: Prompt tuning is an important technique for directing model behaviors and eliciting desired responses.
Approach: They propose to find optimal prompt tokens using soft Q-learning to optimize models for prompt tuning.
Outcome: The proposed method improves on baseline prompt tuning, and the results are more natural and interpretable.
Parameter Efficient Multi-task Fine-tuning by Learning to Transfer Token-wise Prompts (2023.findings-emnlp)

Copied to clipboard

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.

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