English
Related papers

Related papers: Dynamic Compressing Prompts for Efficient Inferenc…

200 papers

Long prompt leads to huge hardware costs when using transformer-based Large Language Models (LLMs). Unfortunately, many tasks, such as summarization, inevitably introduce long documents, and the wide application of in-context learning…

Computation and Language · Computer Science 2024-09-04 Jun Gao , Ziqiang Cao , Wenjie Li

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

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

Large language models (LLMs) have achieved remarkable success in many natural language processing (NLP) tasks. To achieve more accurate output, the prompts used to drive LLMs have become increasingly longer, which incurs higher…

Computation and Language · Computer Science 2025-09-19 Yaxin Gao , Yao Lu , Zongfei Zhang , Jiaqi Nie , Shanqing Yu , Qi Xuan

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

Large language models deliver strong generative performance but at the cost of massive parameter counts, memory use, and decoding latency. Prior work has shown that pruning and structured sparsity can preserve accuracy under substantial…

Computation and Language · Computer Science 2026-04-17 Andrew Kiruluta

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

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

Recent advancements in large language models (LLMs) have enabled their successful application to a broad range of tasks. However, in information-intensive tasks, the prompt length can grow fast, leading to increased computational…

Computation and Language · Computer Science 2025-10-13 Weronika Łajewska , Momchil Hardalov , Laura Aina , Neha Anna John , Hang Su , Lluís Màrquez

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

Prompt compression condenses contexts while maintaining their informativeness for different usage scenarios. It not only shortens the inference time and reduces computational costs during the usage of large language models, but also lowers…

Computation and Language · Computer Science 2024-10-21 Xiao Pu , Tianxing He , Xiaojun Wan

Compressed prompts aid instruction-tuned language models (LMs) in overcoming context window limitations and reducing computational costs. Existing methods, which primarily based on training embeddings, face various challenges associated…

Computation and Language · Computer Science 2024-06-04 Hoyoun Jung , Kyung-Joong Kim

Leveraging large language models (LLMs) for complex natural language tasks typically requires long-form prompts to convey detailed requirements and information, which results in increased memory usage and inference costs. To mitigate these…

Computation and Language · Computer Science 2024-10-18 Zongqian Li , Yinhong Liu , Yixuan Su , Nigel Collier

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 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

The rapid advancement of Large Language Models (LLMs) has inaugurated a transformative epoch in natural language processing, fostering unprecedented proficiency in text generation, comprehension, and contextual scrutiny. Nevertheless,…

Machine Learning · Computer Science 2024-04-22 Cangqing Wang , Yutian Yang , Ruisi Li , Dan Sun , Ruicong Cai , Yuzhu Zhang , Chengqian Fu , Lillian Floyd

The rise of Large Language Models (LLMs) has led to significant interest in prompt compression, a technique aimed at reducing the length of input prompts while preserving critical information. However, the prominent approaches in prompt…

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

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

Large Language Models (LLMs) have demonstrated impressive capabilities in a wide range of natural language processing tasks when leveraging in-context learning. To mitigate the additional computational and financial costs associated with…

Computation and Language · Computer Science 2024-10-22 Tsz Ting Chung , Leyang Cui , Lemao Liu , Xinting Huang , Shuming Shi , Dit-Yan Yeung

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
‹ Prev 1 2 3 10 Next ›