English
Related papers

Related papers: PIP: Parse-Instructed Prefix for Syntactically Con…

200 papers

In a controllable text generation dataset, there exist unannotated attributes that could provide irrelevant learning signals to models that use it for training and thus degrade their performance. We propose focused prefix tuning(FPT) to…

Computation and Language · Computer Science 2023-06-13 Congda Ma , Tianyu Zhao , Makoto Shing , Kei Sawada , Manabu Okumura

Neural table-to-text generation approaches are data-hungry, limiting their adaptation for low-resource real-world applications. Previous works mostly resort to Pre-trained Language Models (PLMs) to generate fluent summaries of a table.…

Computation and Language · Computer Science 2022-08-24 Yutao Luo , Menghua Lu , Gongshen Liu , Shilin Wang

Existing knowledge-grounded conversation systems generate responses typically in a retrieve-then-generate manner. They require a large knowledge base and a strong knowledge retrieval component, which is time- and resource-consuming. In this…

Computation and Language · Computer Science 2023-06-28 Jiaqi Bai , Zhao Yan , Jian Yang , Xinnian Liang , Hongcheng Guo , Zhoujun Li

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

Few-shot abstractive summarization has become a challenging task in natural language generation. To support it, we designed a novel soft prompts architecture coupled with a prompt pre-training plus fine-tuning paradigm that is effective and…

Computation and Language · Computer Science 2022-10-05 Xiaochen Liu , Yang Gao , Yu Bai , Jiawei Li , Yinan Hu , Heyan Huang , Boxing Chen

Prototype-driven text generation uses non-parametric models that first choose from a library of sentence "prototypes" and then modify the prototype to generate the output text. While effective, these methods are inefficient at test time as…

Computation and Language · Computer Science 2020-11-05 Junxian He , Taylor Berg-Kirkpatrick , Graham Neubig

Language models (LMs) trained on vast quantities of unlabelled data have greatly advanced the field of natural language processing (NLP). In this study, we re-visit the widely accepted notion in NLP that continued pre-training LMs on…

Computation and Language · Computer Science 2023-10-09 Zhengxiang Shi , Aldo Lipani

Contrastive language-image pre-training (CLIP) models have demonstrated considerable success across various vision-language tasks, such as text-to-image retrieval, where the model is required to effectively process natural language input to…

Computer Vision and Pattern Recognition · Computer Science 2024-02-26 Hyunjae Kim , Seunghyun Yoon , Trung Bui , Handong Zhao , Quan Tran , Franck Dernoncourt , Jaewoo Kang

Parameter-Efficient finetuning (PEFT) enhances model performance on downstream tasks by updating a minimal subset of parameters. Representation finetuning (ReFT) methods further improve efficiency by freezing model weights and optimizing…

Machine Learning · Computer Science 2025-11-17 Sirui Liang , Pengfei Cao , Jian Zhao , Cong Huang , Jun Zhao , Kang Liu

Prompt tuning is a new, efficient NLP transfer learning paradigm that adds a task-specific prompt in each input instance during the model training stage. It freezes the pre-trained language model and only optimizes a few task-specific…

Computation and Language · Computer Science 2022-04-12 Zhuofeng Wu , Sinong Wang , Jiatao Gu , Rui Hou , Yuxiao Dong , V. G. Vinod Vydiswaran , Hao Ma

This paper surveys and organizes research works in a new paradigm in natural language processing, which we dub "prompt-based learning". Unlike traditional supervised learning, which trains a model to take in an input x and predict an output…

Computation and Language · Computer Science 2021-07-30 Pengfei Liu , Weizhe Yuan , Jinlan Fu , Zhengbao Jiang , Hiroaki Hayashi , Graham Neubig

Generative recommendation has recently emerged as a promising paradigm for sequential recommendation. It formulates the task as an autoregressive generation process, predicting tokens of the next item conditioned on user interaction…

Information Retrieval · Computer Science 2026-05-29 Yuanqing Yu , Yifan Wang , Weizhi Ma , Zhiqiang Guo , Min Zhang

We introduce a data-centric approach for mitigating presentation bias in real-time neural query autocomplete systems through the use of synthetic prefixes. These prefixes are generated from complete user queries collected during regular…

Information Retrieval · Computer Science 2025-10-03 Adithya Rajan , Xiaoyu Liu , Prateek Verma , Vibhu Arora

Prior work on controllable text generation usually assumes that the controlled attribute can take on one of a small set of values known a priori. In this work, we propose a novel task, where the syntax of a generated sentence is controlled…

Computation and Language · Computer Science 2019-06-04 Mingda Chen , Qingming Tang , Sam Wiseman , Kevin Gimpel

Prompts have been shown to be an effective method to adapt a frozen Pretrained Language Model (PLM) to perform well on downstream tasks. Prompts can be represented by a human-engineered word sequence or by a learned continuous embedding. In…

Computation and Language · Computer Science 2023-07-06 Jonathan Pilault , Can Liu , Mohit Bansal , Markus Dreyer

Paraphrasing natural language sentences is a multifaceted process: it might involve replacing individual words or short phrases, local rearrangement of content, or high-level restructuring like topicalization or passivization. Past…

Computation and Language · Computer Science 2020-05-06 Tanya Goyal , Greg Durrett

Prompting and context-based fine-tuning methods, which we call Prefix Learning, have been proposed to enhance the performance of language models on various downstream tasks. They are empirically efficient and effective, matching the…

Machine Learning · Computer Science 2024-10-17 Yingyu Liang , Zhenmei Shi , Zhao Song , Chiwun Yang

Prefix parsing asks whether an input prefix can be extended to a complete string generated by a given grammar. In the weighted setting, it also provides prefix probabilities, which are central to context-free language modeling,…

Computation and Language · Computer Science 2026-05-05 Clemente Pasti , Andreas Opedal , Timothy J. O'Donnell , Ryan Cotterell , Tim Vieira

The rapid increase in the parameter counts of Large Language Models (LLMs), which often reach into the billions or even trillions, presents significant challenges for their practical deployment, particularly in resource-constrained…

Machine Learning · Computer Science 2025-11-18 Yi Cao , Wei-Jie Xu , Yucheng Shen , Weijie Shi , Chi-Min Chan , Jianfeng Qu , Jiajie Xu

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