| 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. |
Similar Papers
Prompt Tuning for Discriminative Pre-trained Language Models (2022.findings-acl)
Copied to clipboard
Yuan Yao, Bowen Dong, Ao Zhang, Zhengyan Zhang, Ruobing Xie, Zhiyuan Liu, Leyu Lin, Maosong Sun, Jianyong Wang
| Challenge: | Recent studies have shown promising results of prompt tuning in stimulating pre-trained language models (PLMs) for natural language processing tasks. |
| Approach: | They propose a prompt tuning framework that reformulates NLP tasks into a discriminative language modeling problem. |
| Outcome: | The proposed framework improves on text classification and question answering tasks and prevents unstable tuning problems in low-resource settings. |
Clip-Tuning: Towards Derivative-free Prompt Learning with a Mixture of Rewards (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing work does not take full advantage of over-parameterized characteristics of large pre-trained language models. |
| Approach: | They propose a method that uses frozen "thinned" networks to obtain a mixture of rewards and advance the derivative-free prompt learning. |
| Outcome: | The proposed method outperforms previous gradient-free prompt learning methods and achieves parity with gradient-based counterparts on seven language understanding benchmarks under few-shot settings. |
Personalized Federated Learning for Text Classification with Gradient-Free Prompt Tuning (2024.findings-naacl)
Copied to clipboard
Rui Wang, Tong Yu, Ruiyi Zhang, Sungchul Kim, Ryan Rossi, Handong Zhao, Junda Wu, Subrata Mitra, Lina Yao, Ricardo Henao
| Challenge: | Pretrained language models (PLMs) are used for personalized federated learning . communication costs are high with large PLMs, and local training is expensive . |
| Approach: | They propose a framework for federated learning with pretrained language models . they propose 'discrete local search' and compression mechanism for local training . |
| Outcome: | The proposed framework achieves superior performance compared with baselines. |
Black-Box Tuning of Vision-Language Models with Effective Gradient Approximation (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Large vision-language models are often not open-source due to preventing abuse or commercial factors. |
| Approach: | They propose a method for parameter-efficient fine-tuning to improve model accessibility . large models are often not open-source due to preventing abuse or commercial factors . they propose implementing a lightweight adapter over the output feature of an inaccessible model . |
| Outcome: | The proposed methods improve on 11 benchmarks and are made publicly available. |
When Gradient Descent Meets Derivative-Free Optimization: A Match Made in Black-Box Scenario (2023.findings-acl)
Copied to clipboard
| Challenge: | Large pre-trained language models (PLMs) are expensive and may not be open-sourced due to commercial considerations and potential risks of misuse. |
| Approach: | They propose to introduce gradient descent into black-box tuning scenario . they propose a method which integrates gradient descent and derivative-free optimization . |
| Outcome: | The proposed method achieves significant performance gains over previous state-of-the-art methods. |
XPrompt: Exploring the Extreme of Prompt Tuning (2022.emnlp-main)
Copied to clipboard
| Challenge: | Prompt tuning learns soft prompts to condition pre-trained Language Models for performing downstream tasks in a parameter-efficient manner. |
| Approach: | They propose a Prompt tuning model with an eXtremely small scale that learns soft prompts to condition the frozen Pre-trained Language Models for performing downstream tasks in a parameter-efficient manner. |
| Outcome: | The proposed model outperforms the vanilla Prompt-Tuning and can significantly improve across tasks and model scales. |
BBTv2: Towards a Gradient-Free Future with Large Language Models (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent work on parameter-efficient tuning (PET) only tunes a small portion of parameters while keeping most of the parameters of the LLM unchanged. |
| Approach: | They propose an improved version of Black-Box Tuning to tune PTMs through gradient descent . they prepend continuous prompts to every layer of the PTM and propose a divide-and-conquer gradient-free algorithm to optimize the prompts alternately. |
| Outcome: | The proposed method achieves comparable performance to full model tuning and state-of-the-art parameter-efficient methods under few-shot settings while maintaining much fewer tunable parameters. |
The Power of Prompt Tuning for Low-Resource Semantic Parsing (2022.acl-short)
Copied to clipboard
| Challenge: | Prompt tuning is an effective method for adapting pre-trained language models to downstream tasks. |
| Approach: | They propose to use prompt tuning for semantic parsing to map natural language utterances onto formal meaning representations. |
| Outcome: | The proposed method outperforms the fine-tuned model on low-resource splits of Overnight and TOPv2 on language representations with increasing model scale and target representations. |
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. |
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. |