English
Related papers

Related papers: The Exploration of Knowledge-Preserving Prompts fo…

200 papers

Reinforcement learning with evaluation metrics as rewards is widely used to enhance specific capabilities of language models. However, for tasks such as factually consistent summarisation, existing metrics remain underdeveloped, limiting…

Computation and Language · Computer Science 2026-05-27 Yuxuan Ye , Raul Santos-Rodriguez , Edwin Simpson

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

Fine-tuning is the de facto way to leverage large pretrained language models to perform downstream tasks. However, it modifies all the language model parameters and therefore necessitates storing a full copy for each task. In this paper, we…

Computation and Language · Computer Science 2021-01-05 Xiang Lisa Li , Percy Liang

Context-based fine-tuning methods, including prompting, in-context learning, soft prompting (also known as prompt tuning), and prefix-tuning, have gained popularity due to their ability to often match the performance of full fine-tuning…

Machine Learning · Computer Science 2024-04-10 Aleksandar Petrov , Philip H. S. Torr , Adel Bibi

Despite the recent progress in language generation models, their outputs may not always meet user expectations. In this work, we study whether informational feedback in natural language can be leveraged to improve generation quality and…

Computation and Language · Computer Science 2023-10-17 Yixin Liu , Budhaditya Deb , Milagro Teruel , Aaron Halfaker , Dragomir Radev , Ahmed H. Awadallah

Currently used metrics for assessing summarization algorithms do not account for whether summaries are factually consistent with source documents. We propose a weakly-supervised, model-based approach for verifying factual consistency and…

Computation and Language · Computer Science 2019-10-29 Wojciech Kryściński , Bryan McCann , Caiming Xiong , Richard Socher

Prompt-based techniques, such as prompt-tuning and prefix-tuning, have gained prominence for their efficiency in fine-tuning large pre-trained models. Despite their widespread adoption, the theoretical foundations of these methods remain…

Machine Learning · Computer Science 2025-04-03 Minh Le , Chau Nguyen , Huy Nguyen , Quyen Tran , Trung Le , Nhat Ho

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

We study whether automatically-induced prompts that effectively extract information from a language model can also be used, out-of-the-box, to probe other language models for the same information. After confirming that discrete prompts…

Computation and Language · Computer Science 2023-03-08 Nathanaël Carraz Rakotonirina , Roberto Dessì , Fabio Petroni , Sebastian Riedel , Marco Baroni

Previous works show that Pre-trained Language Models (PLMs) can capture factual knowledge. However, some analyses reveal that PLMs fail to perform it robustly, e.g., being sensitive to the changes of prompts when extracting factual…

Computation and Language · Computer Science 2022-10-21 Shaobo Li , Xiaoguang Li , Lifeng Shang , Chengjie Sun , Bingquan Liu , Zhenzhou Ji , Xin Jiang , Qun Liu

Prompt tuning (PT), a parameter-efficient technique that only tunes the additional prompt embeddings while keeping the backbone pre-trained language model (PLM) frozen, has shown promising results in language understanding tasks, especially…

Computation and Language · Computer Science 2023-08-08 Mathieu Ravaut , Hailin Chen , Ruochen Zhao , Chengwei Qin , Shafiq Joty , Nancy Chen

A commonly observed problem with the state-of-the art abstractive summarization models is that the generated summaries can be factually inconsistent with the input documents. The fact that automatic summarization may produce…

This paper presents novel prompting techniques to improve the performance of automatic summarization systems for scientific articles. Scientific article summarization is highly challenging due to the length and complexity of these…

Computation and Language · Computer Science 2023-12-18 Aldan Creo , Manuel Lama , Juan C. Vidal

Abstractive summarization is the process of generating a summary given a document as input. Although significant progress has been made, the factual inconsistency between the document and the generated summary still limits its practical…

Computation and Language · Computer Science 2023-04-03 Shuaijie She , Xiang Geng , Shujian Huang , Jiajun Chen

Abstractive summarization models often generate factually inconsistent content particularly when the parametric knowledge of the model conflicts with the knowledge in the input document. In this paper, we analyze the robustness of…

Computation and Language · Computer Science 2024-02-26 Jongyoon Song , Nohil Park , Bongkyu Hwang , Jaewoong Yun , Seongho Joe , Youngjune L. Gwon , Sungroh Yoon

Detecting factual errors in summaries has been an important and challenging subject in summarization research. Inspired by the emergent ability of large language models (LLMs), we explore evaluating factual consistency of summaries by…

Computation and Language · Computer Science 2023-10-13 Shiqi Chen , Siyang Gao , Junxian He

Pre-trained neural abstractive summarization systems have dominated extractive strategies on news summarization performance, at least in terms of ROUGE. However, system-generated abstractive summaries often face the pitfall of factual…

Computation and Language · Computer Science 2020-10-07 Yue Dong , Shuohang Wang , Zhe Gan , Yu Cheng , Jackie Chi Kit Cheung , Jingjing Liu

Recent research shows that pre-trained language models (PLMs) suffer from "prompt bias" in factual knowledge extraction, i.e., prompts tend to introduce biases toward specific labels. Prompt bias presents a significant challenge in…

Computation and Language · Computer Science 2024-03-27 Ziyang Xu , Keqin Peng , Liang Ding , Dacheng Tao , Xiliang Lu

It has been demonstrated that the art of prompt tuning is highly effective in efficiently extracting knowledge from pretrained foundation models, encompassing pretrained language models (PLMs), vision pretrained models, and vision-language…

Computation and Language · Computer Science 2023-05-30 Xianjun Yang , Wei Cheng , Xujiang Zhao , Wenchao Yu , Linda Petzold , Haifeng Chen

Automatic abstractive summaries are found to often distort or fabricate facts in the article. This inconsistency between summary and original text has seriously impacted its applicability. We propose a fact-aware summarization model FASum…

Computation and Language · Computer Science 2021-03-16 Chenguang Zhu , William Hinthorn , Ruochen Xu , Qingkai Zeng , Michael Zeng , Xuedong Huang , Meng Jiang
‹ Prev 1 2 3 10 Next ›