English
Related papers

Related papers: Progressive Prompts: Continual Learning for Langua…

200 papers

Large language models such as GPT-3 (Brown et al., 2020) can perform arbitrary tasks without undergoing fine-tuning after being prompted with only a few labeled examples. An arbitrary task can be reformulated as a natural language prompt,…

Machine Learning · Computer Science 2023-02-07 Ajay Patel , Bryan Li , Mohammad Sadegh Rasooli , Noah Constant , Colin Raffel , Chris Callison-Burch

Most Transformer language models are primarily pretrained on English text, limiting their use for other languages. As the model sizes grow, the performance gap between English and other languages with fewer compute and data resources…

Computation and Language · Computer Science 2023-01-24 Malte Ostendorff , Georg Rehm

Large language models (LLMs) have been applied in various applications due to their astonishing capabilities. With advancements in technologies such as chain-of-thought (CoT) prompting and in-context learning (ICL), the prompts fed to LLMs…

Computation and Language · Computer Science 2023-12-07 Huiqiang Jiang , Qianhui Wu , Chin-Yew Lin , Yuqing Yang , Lili Qiu

There has been growing interest in parameter-efficient methods to apply pre-trained language models to downstream tasks. Building on the Prompt Tuning approach of Lester et al. (2021), which learns task-specific soft prompts to condition a…

Computation and Language · Computer Science 2022-03-18 Tu Vu , Brian Lester , Noah Constant , Rami Al-Rfou , Daniel Cer

This paper introduces \textbf{Q-tuning}, a novel approach for continual prompt tuning that enables the lifelong learning of a pre-trained language model. When learning a new task, Q-tuning trains a task-specific prompt by adding it to a…

Computation and Language · Computer Science 2024-04-24 Yanhui Guo , Shaoyuan Xu , Jinmiao Fu , Jia Liu , Chaosheng Dong , Bryan Wang

As the pre-trained language models (PLMs) continue to grow, so do the hardware and data requirements for fine-tuning PLMs. Therefore, the researchers have come up with a lighter method called \textit{Prompt Learning}. However, during the…

Computation and Language · Computer Science 2022-09-07 Yundi Shi , Piji Li , Changchun Yin , Zhaoyang Han , Lu Zhou , Zhe Liu

Pretrained language models (PLMs) are today the primary model for natural language processing. Despite their impressive downstream performance, it can be difficult to apply PLMs to new languages, a barrier to making their capabilities…

Computation and Language · Computer Science 2024-01-15 Yihong Chen , Kelly Marchisio , Roberta Raileanu , David Ifeoluwa Adelani , Pontus Stenetorp , Sebastian Riedel , Mikel Artetxe

Learning to solve complex sequences of tasks--while both leveraging transfer and avoiding catastrophic forgetting--remains a key obstacle to achieving human-level intelligence. The progressive networks approach represents a step forward in…

Current methods for few-shot fine-tuning of pretrained masked language models (PLMs) require carefully engineered prompts and verbalizers for each new task to convert examples into a cloze-format that the PLM can score. In this work, we…

Computation and Language · Computer Science 2022-04-27 Rabeeh Karimi Mahabadi , Luke Zettlemoyer , James Henderson , Marzieh Saeidi , Lambert Mathias , Veselin Stoyanov , Majid Yazdani

Differentiable Search Index (DSI) utilizes pre-trained language models to perform indexing and document retrieval via end-to-end learning without relying on external indexes. However, DSI requires full re-training to index new documents,…

Information Retrieval · Computer Science 2025-07-01 Tuan-Luc Huynh , Thuy-Trang Vu , Weiqing Wang , Yinwei Wei , Trung Le , Dragan Gasevic , Yuan-Fang Li , Thanh-Toan Do

As LLMs evolve, significant effort is spent on manually crafting prompts. While existing prompt optimization methods automate this process, they rely solely on learning from incorrect samples, leading to a sub-optimal performance.…

Computation and Language · Computer Science 2024-09-24 Mingqi Li , Karan Aggarwal , Yong Xie , Aitzaz Ahmad , Stephen Lau

One of the main motivations of studying continual learning is that the problem setting allows a model to accrue knowledge from past tasks to learn new tasks more efficiently. However, recent studies suggest that the key metric that…

Machine Learning · Computer Science 2023-03-16 Jiefeng Chen , Timothy Nguyen , Dilan Gorur , Arslan Chaudhry

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

Prompt compression condenses contexts while maintaining their informativeness for different usage scenarios. It not only shortens the inference time and reduces computational costs during the usage of large language models, but also lowers…

Computation and Language · Computer Science 2024-10-21 Xiao Pu , Tianxing He , Xiaojun Wan

Foundation models have transformed multimedia analysis by enabling robust and transferable representations across diverse modalities and tasks. However, their static deployment conflicts with growing societal and regulatory demands --…

It has been shown for English that discrete and soft prompting perform strongly in few-shot learning with pretrained language models (PLMs). In this paper, we show that discrete and soft prompting perform better than finetuning in…

Computation and Language · Computer Science 2021-09-09 Mengjie Zhao , Hinrich Schütze

Continuous prompts, or "soft prompts", are a widely-adopted parameter-efficient tuning strategy for large language models, but are often less favorable due to their opaque nature. Prior attempts to interpret continuous prompts relied on…

Computation and Language · Computer Science 2024-10-16 Dana Ramati , Daniela Gottesman , Mor Geva

We introduce a conceptually simple and scalable framework for continual learning domains where tasks are learned sequentially. Our method is constant in the number of parameters and is designed to preserve performance on previously…

Prompt tuning is one of the successful approaches for parameter-efficient tuning of pre-trained language models. Despite being arguably the most parameter-efficient (tuned soft prompts constitute <0.1% of total parameters), it typically…

Computation and Language · Computer Science 2023-05-09 Anastasia Razdaibiedina , Yuning Mao , Rui Hou , Madian Khabsa , Mike Lewis , Jimmy Ba , Amjad Almahairi

Pretrained language models (PTLMs) are typically learned over a large, static corpus and further fine-tuned for various downstream tasks. However, when deployed in the real world, a PTLM-based model must deal with data distributions that…

Computation and Language · Computer Science 2022-07-20 Xisen Jin , Dejiao Zhang , Henghui Zhu , Wei Xiao , Shang-Wen Li , Xiaokai Wei , Andrew Arnold , Xiang Ren
‹ Prev 1 4 5 6 7 8 10 Next ›