English
Related papers

Related papers: Characterizing Prompt Compression Methods for Long…

200 papers

Transformer-based self-supervised models have achieved remarkable success in speech processing, but their large size and high inference cost present significant challenges for real-world deployment. While numerous compression techniques…

Computation and Language · Computer Science 2025-08-19 Tzu-Quan Lin , Tsung-Huan Yang , Chun-Yao Chang , Kuang-Ming Chen , Tzu-hsun Feng , Hung-yi Lee , Hao Tang

We present a new neural model for text summarization that first extracts sentences from a document and then compresses them. The proposed model offers a balance that sidesteps the difficulties in abstractive methods while generating more…

Information Retrieval · Computer Science 2019-04-08 Afonso Mendes , Shashi Narayan , Sebastião Miranda , Zita Marinho , André F. T. Martins , Shay B. Cohen

While the numerous parameters in Large Language Models (LLMs) contribute to their superior performance, this massive scale makes them inefficient and memory-hungry. Thus, they are hard to deploy on commodity hardware, such as one single…

Computation and Language · Computer Science 2023-10-11 Zhaozhuo Xu , Zirui Liu , Beidi Chen , Yuxin Tang , Jue Wang , Kaixiong Zhou , Xia Hu , Anshumali Shrivastava

Despite the remarkable success of Large Language Models (LLMs), the massive size poses significant deployment challenges, particularly on resource-constrained hardware. While existing LLM compression methods focus on quantization, pruning…

Artificial Intelligence · Computer Science 2023-10-12 Song Guo , Jiahang Xu , Li Lyna Zhang , Mao Yang

Multimodal large language models (MLLMs) have made remarkable strides, largely driven by their ability to process increasingly long and complex contexts, such as high-resolution images, extended video sequences, and lengthy audio input.…

Computer Vision and Pattern Recognition · Computer Science 2026-02-03 Kele Shao , Keda Tao , Kejia Zhang , Sicheng Feng , Mu Cai , Yuzhang Shang , Haoxuan You , Can Qin , Yang Sui , Huan Wang

Large Vision-Language Models (LVLMs) excel in visual understanding and reasoning, but the excessive visual tokens lead to high inference costs. Although recent token reduction methods mitigate this issue, they mainly target single-turn…

Computer Vision and Pattern Recognition · Computer Science 2026-03-24 Yi Wang , Haofei Zhang , Qihan Huang , Anda Cao , Gongfan Fang , Wei Wang , Xuan Jin , Jie Song , Mingli Song , Xinchao Wang

Large Language Models (LLMs) have shown exceptional abilities for multiple different natural language processing tasks. While prompting is a crucial tool for LLM inference, we observe that there is a significant cost associated with…

Computation and Language · Computer Science 2024-10-18 Muhammad Asif Ali , Zhengping Li , Shu Yang , Keyuan Cheng , Yang Cao , Tianhao Huang , Guimin Hu , Weimin Lyu , Lijie Hu , Lu Yu , Di Wang

The availability of a vast array of research papers in any area of study, necessitates the need of automated summarisation systems that can present the key research conducted and their corresponding findings. Scientific paper summarisation…

Computation and Language · Computer Science 2024-07-30 Grishma Sharma , Aditi Paretkar , Deepak Sharma

Pre-trained large language models can perform natural language processing downstream tasks by conditioning on human-designed prompts. However, a prompt-based approach often requires "prompt engineering" to design different prompts,…

Computation and Language · Computer Science 2024-05-28 Mingyang Song , Yi Feng , Liping Jing

Prompting is a mainstream paradigm for adapting large language models to specific natural language processing tasks without modifying internal parameters. Therefore, detailed supplementary knowledge needs to be integrated into external…

Computation and Language · Computer Science 2024-12-03 Kaiyan Chang , Songcheng Xu , Chenglong Wang , Yingfeng Luo , Xiaoqian Liu , Tong Xiao , Jingbo Zhu

In long context scenarios, large language models (LLMs) face three main challenges: higher computational cost, performance reduction, and position bias. Research indicates that LLM performance hinges on the density and position of key…

Computation and Language · Computer Science 2024-08-13 Huiqiang Jiang , Qianhui Wu , Xufang Luo , Dongsheng Li , Chin-Yew Lin , Yuqing Yang , Lili Qiu

Emerged as one of the best performing techniques for extractive summarization, determinantal point processes select the most probable set of sentences to form a summary according to a probability measure defined by modeling sentence…

Computation and Language · Computer Science 2019-10-28 Sangwoo Cho , Chen Li , Dong Yu , Hassan Foroosh , Fei Liu

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

How can we compress language models without sacrificing accuracy? The number of compression algorithms for language models is rapidly growing to benefit from remarkable advances of recent language models without side effects due to the…

Computation and Language · Computer Science 2024-01-30 Seungcheol Park , Jaehyeon Choi , Sojin Lee , U Kang

Retrieved documents containing noise will hinder RAG from detecting answer clues and make the inference process slow and expensive. Therefore, context compression is necessary to enhance its accuracy and efficiency. Existing context…

Computation and Language · Computer Science 2026-04-28 Qianchi Zhang , Hainan Zhang , Liang Pang , Hongwei Zheng , Zhiming Zheng

Recent neural network approaches to summarization are largely either selection-based extraction or generation-based abstraction. In this work, we present a neural model for single-document summarization based on joint extraction and…

Computation and Language · Computer Science 2019-09-11 Jiacheng Xu , Greg Durrett

Compressive summarization systems typically rely on a crafted set of syntactic rules to determine what spans of possible summary sentences can be deleted, then learn a model of what to actually delete by optimizing for content selection…

Computation and Language · Computer Science 2020-10-16 Shrey Desai , Jiacheng Xu , Greg Durrett

Transformer-based language models (LMs) are powerful and widely-applicable tools, but their usefulness is constrained by a finite context window and the expensive computational cost of processing long text documents. We propose to adapt…

Computation and Language · Computer Science 2023-11-07 Alexis Chevalier , Alexander Wettig , Anirudh Ajith , Danqi Chen

While multi-vector retrieval models outperform single-vector models of comparable size in retrieval quality, their practicality is limited by substantially larger index sizes, driven by the additional sequence-length dimension in their…

Information Retrieval · Computer Science 2026-03-25 Rohan Jha , Chunsheng Zuo , Reno Kriz , Benjamin Van Durme

In-Context Learning and Chain-of-Thought prompting improve reasoning in large language models (LLMs). These typically come at the cost of longer, more expensive prompts that may contain redundant information. Prompt compression based on…

Computation and Language · Computer Science 2026-04-09 Caleb Zheng , Jyotika Singh , Fang Tu , Weiyi Sun , Sujeeth Bharadwaj , Yassine Benajiba , Sujith Ravi , Eli Shlizerman , Dan Roth