| 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. |
Similar Papers
Parameter Efficient Multi-task Fine-tuning by Learning to Transfer Token-wise Prompts (2023.findings-emnlp)
Copied to clipboard
Muling Wu, Wenhao Liu, Jianhan Xu, Changze Lv, Zixuan Ling, Tianlong Li, Longtao Huang, Xiaoqing Zheng, Xuanjing Huang
| 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. |
Leveraging Self-Attention for Input-Dependent Soft Prompting in LLMs (2025.acl-short)
Copied to clipboard
| Challenge: | Large language models require fine-tuning, which is computationally expensive and challenging. |
| Approach: | They propose a method that generates soft prompts based on input tokens and attends different tokens with varying importance. |
| Outcome: | The proposed method is simple and efficient, keeping the number of trainable parameters small. |
SMoP: Towards Efficient and Effective Prompt Tuning with Sparse Mixture-of-Prompts (2023.emnlp-main)
Copied to clipboard
| 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. |
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. |
MPrompt: Exploring Multi-level Prompt Tuning for Machine Reading Comprehension (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing soft prompt methods focus on designing the input-independent prompts that steer the model to fit the domain of the new dataset. |
| Approach: | They propose a multi-level prompt tuning method that utilizes prompts at task-specific, domain-specific and context-specific levels to enhance the comprehension of input semantics. |
| Outcome: | The proposed method improves on 12 benchmarks on various QA formats and achieves an average improvement of 1.94% over the state-of-the-art methods. |
Ultra-Low-Dimensional Prompt Tuning via Random Projection (2026.eacl-long)
Copied to clipboard
| Challenge: | Prompt tuning addresses parameter-efficiency by learning embeddings, but these embeddements are typically tied to the model’s hidden dimensionality, limiting parameter saving. |
| Approach: | They propose a parameter-efficient method that learns prompt embeddings exclusively in the input layer of the model and uses a frozen random matrix for up-projection. |
| Outcome: | The proposed method outperforms previous methods using significantly fewer parameters while maintaining performance. |
PromptIntern: Saving Inference Costs by Internalizing Recurrent Prompt during Large Language Model Fine-tuning (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Recent advances in fine-tuning large language models have greatly enhanced their usage in domain-specific tasks. |
| Approach: | They propose a method which internalizes prompt knowledge during model fine-tuning to achieve efficient inference and save costs. |
| Outcome: | The proposed approach reduces input tokens by 90%, accelerates inference by 4.2 times, and reduces monetary inference costs by 88.3%. |
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. |
Prompt Tuning for Unified Multimodal Pretrained Models (2023.findings-acl)
Copied to clipboard
| Challenge: | Prompt tuning has demonstrated success in natural language pretraining and even vision pretraining. |
| Approach: | They propose to apply prompt tuning to a unified sequence-to-sequence pretrained model by adding a sequence of learnable embeddings to each layer and finetuning the pretrained models on downstream tasks. |
| Outcome: | The proposed method outperforms other parameter-efficient tuning methods on multimodal models and is robust against adversarial attacks. |
Reliable Gradient-free and Likelihood-free Prompt Tuning (2023.findings-eacl)
Copied to clipboard
| Challenge: | Large pre-trained language models are often offered as black-box APIs due to privacy or commercial constraints. |
| Approach: | They propose to tune the soft prompts without requiring gradient computation and extend the model to include a distribution over prompts. |
| Outcome: | The proposed methods are competitive with gradient-based approaches with full access to the PLM. |