English
Related papers

Related papers: DSPC: Dual-Stage Progressive Compression Framework…

200 papers

Large Language Models (LLMs) have shown outstanding performance across a variety of tasks, partly due to advanced prompting techniques. However, these techniques often require lengthy prompts, which increase computational costs and can…

Computation and Language · Computer Science 2025-04-16 Jinwu Hu , Wei Zhang , Yufeng Wang , Yu Hu , Bin Xiao , Mingkui Tan , Qing Du

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

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

Large language models (LLMs) have triggered a new stream of research focusing on compressing the context length to reduce the computational cost while ensuring the retention of helpful information for LLMs to answer the given question.…

Computation and Language · Computer Science 2024-12-20 Barys Liskavets , Maxim Ushakov , Shuvendu Roy , Mark Klibanov , Ali Etemad , Shane Luke

Despite the recent success of Large Language Models (LLMs), it remains challenging to feed LLMs with long prompts due to the fixed size of LLM inputs. As a remedy, prompt compression becomes a promising solution by removing redundant tokens…

Computation and Language · Computer Science 2025-01-06 Ziyang Yu , Yuyu Liu

Gradient-free prompt optimization methods have made significant strides in enhancing the performance of closed-source Large Language Models (LLMs) across a wide range of tasks. However, existing approaches make light of the importance of…

Computation and Language · Computer Science 2024-10-03 Muchen Yang , Moxin Li , Yongle Li , Zijun Chen , Chongming Gao , Junqi Zhang , Yangyang Li , Fuli Feng

With the wide adoption of language models for IR -- and specifically RAG systems -- the latency of the underlying LLM becomes a crucial bottleneck, since the long contexts of retrieved passages lead large prompts and therefore, compute…

Information Retrieval · Computer Science 2026-04-06 Cornelius Kummer , Lena Jurkschat , Michael Färber , Sahar Vahdati

Prompt engineering enables Large Language Models (LLMs) to perform a variety of tasks. However, lengthy prompts significantly increase computational complexity and economic costs. To address this issue, we study six prompt compression…

Computation and Language · Computer Science 2025-05-02 Zheng Zhang , Jinyi Li , Yihuai Lan , Xiang Wang , Hao Wang

Large language models (LLMs) demonstrate exceptional capabilities in various scenarios. However, they suffer from much redundant information and are sensitive to the position of key information in long context scenarios. To address these…

Computation and Language · Computer Science 2025-02-11 Jiwei Tang , Jin Xu , Tingwei Lu , Zhicheng Zhang , Yiming Zhao , Lin Hai , Hai-Tao Zheng

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

This paper focuses on task-agnostic prompt compression for better generalizability and efficiency. Considering the redundancy in natural language, existing approaches compress prompts by removing tokens or lexical units according to their…

Although applications involving long-context inputs are crucial for the effective utilization of large language models (LLMs), they also result in increased computational costs and reduced performance. To address this challenge, we propose…

Computation and Language · Computer Science 2025-02-06 Weizhi Fei , Xueyan Niu , Guoqing Xie , Yingqing Liu , Bo Bai , Wei Han

We formalize the problem of prompt compression for large language models (LLMs) and present a framework to unify token-level prompt compression methods which create hard prompts for black-box models. We derive the distortion-rate function…

Machine Learning · Computer Science 2024-12-12 Alliot Nagle , Adway Girish , Marco Bondaschi , Michael Gastpar , Ashok Vardhan Makkuva , Hyeji Kim

Prompt-tuning (PT) for large language models (LLMs) can facilitate the performance on various conventional NLP tasks with significantly fewer trainable parameters. However, our investigation reveals that PT provides limited improvement and…

Computation and Language · Computer Science 2025-04-15 Sinan Fan , Liang Xie , Chen Shen , Ge Teng , Xiaosong Yuan , Xiaofeng Zhang , Chenxi Huang , Wenxiao Wang , Xiaofei He , Jieping Ye

Prompt compression reduces inference cost and context length in large language models, but prior evaluations focus primarily on autoregressive architectures. This study investigates whether prompt compression transfers effectively to…

Computation and Language · Computer Science 2026-05-19 Sterling Huang , Abigayle Brown , Jiyoo Noh , Jiakang Xu , Wantong Huo , Kaung Myat Kyaw , Jonathan Chan

The emergence of large language models (LLMs) like GPT-4 has revolutionized natural language processing (NLP), enabling diverse, complex tasks. However, extensive token counts lead to high computational and financial burdens. To address…

Computation and Language · Computer Science 2025-03-12 Yun-Hao Cao , Yangsong Wang , Shuzheng Hao , Zhenxing Li , Chengjun Zhan , Sichao Liu , Yi-Qi Hu

Prompt tuning (PT) offers a cost-effective alternative to fine-tuning large-scale pre-trained language models (PLMs), requiring only a few parameters in soft prompt tokens added before the input text. However, existing PT approaches face…

Computation and Language · Computer Science 2025-02-19 Pengxiang Lan , Haoyu Xu , Enneng Yang , Yuliang Liang , Guibing Guo , Jianzhe Zhao , Xingwei Wang

In-context learning has established itself as an important learning paradigm for Large Language Models (LLMs). In this paper, we demonstrate that LLMs can learn encoding keys in-context and perform analysis directly on encoded…

Computation and Language · Computer Science 2026-04-16 Andresa Rodrigues de Campos , David Lee , Imry Kissos , Piyush Paritosh

Prompt compression methods enhance the efficiency of Large Language Models (LLMs) and minimize the cost by reducing the length of input context. The goal of prompt compression is to shorten the LLM prompt while maintaining a high generation…

Computation and Language · Computer Science 2025-08-25 Tinghui Zhang , Yifan Wang , Daisy Zhe Wang

The large language models have achieved superior performance on various natural language tasks. One major drawback of such approaches is they are resource-intensive in fine-tuning new datasets. Soft-prompt tuning presents a…

Computation and Language · Computer Science 2023-10-30 Guoxin Chen , Yiming Qian , Bowen Wang , Liangzhi Li
‹ Prev 1 2 3 10 Next ›