English
Related papers

Related papers: PromptSum: Parameter-Efficient Controllable Abstra…

200 papers

The advent of large language models (LLMs) has significantly advanced natural language processing tasks like text summarization. However, their large size and computational demands, coupled with privacy concerns in data transmission, limit…

Computation and Language · Computer Science 2024-03-18 Pengcheng Jiang , Cao Xiao , Zifeng Wang , Parminder Bhatia , Jimeng Sun , Jiawei Han

Prompt optimization is essential for enhancing the performance of Large Language Models (LLMs) in a range of Natural Language Processing (NLP) tasks, particularly in scenarios of few-shot learning where training examples are incorporated…

Computation and Language · Computer Science 2024-08-15 Dai Do , Quan Tran , Svetha Venkatesh , Hung Le

Prompt tuning has recently emerged as an effective method for adapting pre-trained language models to a number of language understanding and generation tasks. In this paper, we investigate prompt tuning for semantic parsing -- the task of…

Computation and Language · Computer Science 2022-04-04 Nathan Schucher , Siva Reddy , Harm de Vries

Prompt tuning approaches, which learn task-specific soft prompts for a downstream task conditioning on frozen pre-trained models, have attracted growing interest due to its parameter efficiency. With large language models and sufficient…

Computation and Language · Computer Science 2023-03-02 Xiangyu Peng , Chen Xing , Prafulla Kumar Choubey , Chien-Sheng Wu , Caiming Xiong

The increasingly Large Language Models (LLMs) demonstrate stronger language understanding and generation capabilities, while the memory demand and computation cost of fine-tuning LLMs on downstream tasks are non-negligible. Besides,…

Computation and Language · Computer Science 2023-09-14 Ting Hu , Christoph Meinel , Haojin Yang

Parameter-efficient transfer learning (PETL) is proposed as a cost-effective way to transfer pre-trained models to downstream tasks, avoiding the high cost of updating entire large-scale pre-trained models (LPMs). In this work, we present…

Computer Vision and Pattern Recognition · Computer Science 2024-07-03 Yijin Huang , Pujin Cheng , Roger Tam , Xiaoying Tang

For long-tailed classification, most works often pretrain a big model on a large-scale dataset, and then fine-tune the whole model for adapting to long-tailed data. Though promising, fine-tuning the whole pretrained model tends to suffer…

Computer Vision and Pattern Recognition · Computer Science 2023-03-29 Bowen Dong , Pan Zhou , Shuicheng Yan , Wangmeng Zuo

Recent pre-trained language models (PLMs) achieve promising results in existing abstractive summarization datasets. However, existing summarization benchmarks overlap in time with the standard pre-training corpora and finetuning datasets.…

Computation and Language · Computer Science 2023-11-03 Chi Seng Cheang , Hou Pong Chan , Derek F. Wong , Xuebo Liu , Zhaocong Li , Yanming Sun , Shudong Liu , Lidia S. Chao

Visual prompt tuning (VPT) is a promising solution incorporating learnable prompt tokens to customize pre-trained models for downstream tasks. However, VPT and its variants often encounter challenges like prompt initialization, prompt…

Computer Vision and Pattern Recognition · Computer Science 2024-05-28 Yuzhu Wang , Lechao Cheng , Chaowei Fang , Dingwen Zhang , Manni Duan , Meng Wang

The rapid advancements in Large Language Models (LLMs) have revolutionized natural language processing (NLP) and related fields. However, fine-tuning these models for specific tasks remains computationally expensive and risks degrading…

Computation and Language · Computer Science 2024-12-17 Md Kowsher , Nusrat Jahan Prottasha , Prakash Bhat

Large language models (LLMs) have shown increasing power on various natural language processing (NLP) tasks. However, tuning these models for downstream tasks usually needs exorbitant costs or is unavailable due to commercial…

Computation and Language · Computer Science 2024-05-07 Qiushi Sun , Chengcheng Han , Nuo Chen , Renyu Zhu , Jingyang Gong , Xiang Li , Ming Gao

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

Length control in Large Language Models (LLMs) is a crucial but under-addressed challenge, with applications ranging from voice interfaces requiring concise responses to research summaries needing comprehensive outputs. Current approaches…

Computation and Language · Computer Science 2025-11-04 Adewale Akinfaderin , Shreyas Subramanian , Akarsha Sehwag

Reliable evaluation of large language model (LLM)-generated summaries remains an open challenge, particularly across heterogeneous domains and document lengths. We conduct a comprehensive meta-evaluation of 14 automatic summarization…

Computation and Language · Computer Science 2026-04-29 Huyen Nguyen , Haoxuan Zhang , Yang Zhang , Junhua Ding , Haihua Chen

Memory-efficient large language models are good at refining text input for better readability. However, controllability is a matter of concern when it comes to text generation tasks with long inputs, such as multi-document summarization. In…

Computation and Language · Computer Science 2023-10-06 Litton J Kurisinkel , Nancy F chen

This paper introduces a novel pipeline for summarising timelines of events reported by multiple news sources. Transformer-based models for abstractive summarisation generate coherent and concise summaries of long documents but can fail to…

Machine Learning · Computer Science 2023-11-06 Yuxuan Ye , Edwin Simpson

We explore the idea of automatically crafting a tuning dataset for Statistical Machine Translation (SMT) that makes the hyper-parameters of the SMT system more robust with respect to some specific deficiencies of the parameter tuning…

Computation and Language · Computer Science 2017-10-03 Preslav Nakov , Stephan Vogel

Extractive summarization can produce faithful summaries but often requires additional constraints such as a desired summary length. Traditional sentence compression models do not typically consider the constraints because of their…

Computation and Language · Computer Science 2024-06-21 Juseon-Do , Jingun Kwon , Hidetaka Kamigaito , Manabu Okumura

Recent advances have shown that optimizing prompts for Large Language Models (LLMs) can significantly improve task performance, yet many optimization techniques rely on heuristics or manual exploration. We present LatentPrompt, a…

Computation and Language · Computer Science 2025-08-05 Mateusz Bystroński , Grzegorz Piotrowski , Nitesh V. Chawla , Tomasz Kajdanowicz

Prompt tuning, or the conditioning of a frozen pretrained language model (PLM) with soft prompts learned from data, has demonstrated impressive performance on a wide range of NLP tasks. However, prompt tuning requires a large training…

Computation and Language · Computer Science 2022-10-24 Xu Guo , Boyang Li , Han Yu