English
Related papers

Related papers: Reliable Gradient-free and Likelihood-free Prompt …

200 papers

Soft prompt tuning is a parameter-efficient method for adapting LLMs to specific tasks, but suffers from a lack of interpretability. Building on recent work on interpreting soft prompts (Ramati et al., 2024), we explore how training a…

Computation and Language · Computer Science 2026-05-28 Pitipat Kongsomjit , Suryansh Goyal , Jacob Whitehill

The large language models have achieved superior performance on various natural language tasks. One major drawback of such approaches is they are resource-intensive in fine-tuning new datasets. Soft-prompt tuning presents a…

Computation and Language · Computer Science 2023-10-30 Guoxin Chen , Yiming Qian , Bowen Wang , Liangzhi Li

Most downstream adaptation methods tune all or part of the parameters of pre-trained models (PTMs) through gradient descent, where the tuning cost increases linearly with the growth of the model size. By contrast, gradient-free methods only…

Computation and Language · Computer Science 2022-10-17 Tianxiang Sun , Zhengfu He , Hong Qian , Yunhua Zhou , Xuanjing Huang , Xipeng Qiu

Consistently scaling pre-trained language models (PLMs) imposes substantial burdens on model adaptation, necessitating more efficient alternatives to conventional fine-tuning. Given the advantage of prompting in the zero-shot setting and…

Computation and Language · Computer Science 2023-06-01 Yulin Chen , Ning Ding , Xiaobin Wang , Shengding Hu , Hai-Tao Zheng , Zhiyuan Liu , Pengjun Xie

Prompts for pre-trained language models (PLMs) have shown remarkable performance by bridging the gap between pre-training tasks and various downstream tasks. Among these methods, prompt tuning, which freezes PLMs and only tunes soft…

Computation and Language · Computer Science 2022-03-15 Yuxian Gu , Xu Han , Zhiyuan Liu , Minlie Huang

There are two primary ways of incorporating new information into a language model (LM): changing its prompt or changing its parameters, e.g. via fine-tuning. Parameter updates incur no long-term storage cost for model changes. However, for…

Computation and Language · Computer Science 2025-06-27 Eric Zhang , Leshem Choshen , Jacob Andreas

Prompting large language models has gained immense popularity in recent years due to the advantage of producing good results even without the need for labelled data. However, this requires prompt tuning to get optimal prompts that lead to…

Computation and Language · Computer Science 2024-03-06 Jacob-Junqi Tian , David Emerson , Sevil Zanjani Miyandoab , Deval Pandya , Laleh Seyyed-Kalantari , Faiza Khan Khattak

Prompt Learning has recently gained great popularity in bridging the gap between pretraining tasks and various downstream tasks. It freezes Pretrained Language Models (PLMs) and only tunes a few task-related parameters (prompts) for…

Computation and Language · Computer Science 2022-06-07 Yuezihan Jiang , Hao Yang , Junyang Lin , Hanyu Zhao , An Yang , Chang Zhou , Hongxia Yang , Zhi Yang , Bin Cui

Fine-tuned pre-trained language models (PLMs) have achieved awesome performance on almost all NLP tasks. By using additional prompts to fine-tune PLMs, we can further stimulate the rich knowledge distributed in PLMs to better serve…

Computation and Language · Computer Science 2021-09-16 Xu Han , Weilin Zhao , Ning Ding , Zhiyuan Liu , Maosong Sun

Recently, pretrained language models (PLMs) have had exceptional success in language generation. To leverage the rich knowledge encoded by PLMs, a simple yet powerful paradigm is to use prompts in the form of either discrete tokens or…

Computation and Language · Computer Science 2022-10-04 Tianyi Tang , Junyi Li , Wayne Xin Zhao , Ji-Rong Wen

Extremely large pre-trained language models (PTMs) such as GPT-3 are usually released as a service. It allows users to design task-specific prompts to query the PTMs through some black-box APIs. In such a scenario, which we call…

Computation and Language · Computer Science 2022-06-28 Tianxiang Sun , Yunfan Shao , Hong Qian , Xuanjing Huang , Xipeng Qiu

Prompt tuning (PT) is a promising parameter-efficient method to utilize extremely large pre-trained language models (PLMs), which can achieve comparable performance to full-parameter fine-tuning by only tuning a few soft prompts. However,…

Computation and Language · Computer Science 2023-12-19 Yusheng Su , Xiaozhi Wang , Yujia Qin , Chi-Min Chan , Yankai Lin , Huadong Wang , Kaiyue Wen , Zhiyuan Liu , Peng Li , Juanzi Li , Lei Hou , Maosong Sun , Jie Zhou

Large language models (LLMs) are excellent in-context learners. However, the sensitivity of data contained in prompts raises privacy concerns. Our work first shows that these concerns are valid: we instantiate a simple but highly effective…

Machine Learning · Computer Science 2023-05-26 Haonan Duan , Adam Dziedzic , Nicolas Papernot , Franziska Boenisch

Derivative-free prompt learning has emerged as a lightweight alternative to prompt tuning, which only requires model inference to optimize the prompts. However, existing work did not take full advantage of the over-parameterized…

Computation and Language · Computer Science 2022-10-24 Yekun Chai , Shuohuan Wang , Yu Sun , Hao Tian , Hua Wu , Haifeng Wang

The performance of large language models in domain-specific tasks necessitates fine-tuning, which is computationally expensive and technically challenging. This paper focuses on parameter-efficient fine-tuning using soft prompting, a…

Computation and Language · Computer Science 2025-06-09 Ananth Muppidi , Abhilash Nandy , Sambaran Bandyopadhyay

Pre-trained Language Models (PLMs) have achieved remarkable performance for various language understanding tasks in IR systems, which require the fine-tuning process based on labeled training data. For low-resource scenarios, prompt-based…

Computation and Language · Computer Science 2022-04-04 Ziyun Xu , Chengyu Wang , Minghui Qiu , Fuli Luo , Runxin Xu , Songfang Huang , Jun Huang

The strength of modern generative models lies in their ability to be controlled through text-based prompts. Typical "hard" prompts are made from interpretable words and tokens, and must be hand-crafted by humans. There are also "soft"…

Machine Learning · Computer Science 2023-06-02 Yuxin Wen , Neel Jain , John Kirchenbauer , Micah Goldblum , Jonas Geiping , Tom Goldstein

Aligning LLMs for math tutoring typically requires RL-based training with multi-GPU infrastructure. We investigate whether training-free prompt optimization-evolving only the system prompt via API calls-can serve as a practical alternative.…

Computation and Language · Computer Science 2026-05-27 Unggi Lee , Minchul Shin , Yeil Jeong , Sookbun Lee , Jeongsu Moon , Kyungtae Joo , Eunjoo Lee , Hoilym Kwon

The increasing scale of general-purpose Pre-trained Language Models (PLMs) necessitates the study of more efficient adaptation across different downstream tasks. In this paper, we establish a Black-box Discrete Prompt Learning (BDPL) to…

Computation and Language · Computer Science 2023-02-24 Shizhe Diao , Zhichao Huang , Ruijia Xu , Xuechun Li , Yong Lin , Xiao Zhou , Tong Zhang

Requirements classification assigns natural language requirements to predefined classes, such as functional and non functional. Accurate classification reduces risk and improves software quality. Most existing models rely on supervised…

Software Engineering · Computer Science 2025-09-18 Manal Binkhonain , Reem Alfayaz
‹ Prev 1 2 3 10 Next ›