English
Related papers

Related papers: Better Prompt Compression Without Multi-Layer Perc…

200 papers

The large attention-based encoder-decoder network (Transformer) has become prevailing recently due to its effectiveness. But the high computation complexity of its decoder raises the inefficiency issue. By examining the mathematic…

Computation and Language · Computer Science 2023-05-12 Yanyang Li , Ye Lin , Tong Xiao , Jingbo Zhu

Efficient context compression is crucial for improving the accuracy and scalability of question answering. For the efficiency of Retrieval Augmented Generation, context should be delivered fast, compact, and precise to ensure clue…

Computation and Language · Computer Science 2026-03-11 Thao Do , Dinh Phu Tran , An Vo , Seon Kwon Kim , Daeyoung Kim

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

Automatic prompt optimization (APO) has driven significant gains in LLM-based agentic workflows. However, existing methods treat each task's prompt as a monolithic, instance-blind string optimized through global edits, producing brittle…

Artificial Intelligence · Computer Science 2026-05-28 Jyotirmoy Nath , Neeraj Kumar , Brejesh Lall

Large Language Models (LLMs) have changed the way natural language processing works, but it is still hard to store and manage prompts efficiently in production environments. This paper presents LoPace (Lossless Optimized Prompt Accurate…

Databases · Computer Science 2026-02-17 Aman Ulla

Federated Learning (FL) has gained popularity for fine-tuning large language models (LLMs) across multiple nodes, each with its own private data. While LoRA has been widely adopted for parameter efficient federated fine-tuning, recent…

Machine Learning · Computer Science 2025-03-11 Navyansh Mahla , Sunny Gupta , Amit Sethi

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

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…

Large Language Models (LLMs) have garnered widespread attention due to their remarkable performance across various tasks. However, to mitigate the issue of hallucinations, LLMs often incorporate retrieval-augmented pipeline to provide them…

Computation and Language · Computer Science 2024-08-29 Haowen Hou , Fei Ma , Binwen Bai , Xinxin Zhu , Fei Yu

Abstractive compression utilizes smaller langauge models to condense query-relevant context, reducing computational costs in retrieval-augmented generation (RAG). However,retrieved documents often include information that is either…

Computation and Language · Computer Science 2025-11-19 Singon Kim , Gunho Jung , Seong-Whan Lee

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

Abstractive compression utilizes smaller langauge models to condense query-relevant context, reducing computational costs in retrieval-augmented generation (RAG). However, retrieved documents often include information that is either…

Computation and Language · Computer Science 2025-12-11 Singon Kim

Large language models (LLMs) require lengthy prompts as the input context to produce output aligned with user intentions, a process that incurs extra costs during inference. In this paper, we propose the Gist COnditioned deCOding…

Computation and Language · Computer Science 2024-02-27 Xinze Li , Zhenghao Liu , Chenyan Xiong , Shi Yu , Yukun Yan , Shuo Wang , Ge Yu

Blind Compressed Image Restoration (CIR) has garnered significant attention due to its practical applications. It aims to mitigate compression artifacts caused by unknown quality factors, particularly with JPEG codecs. Existing works on…

Computer Vision and Pattern Recognition · Computer Science 2024-04-29 Bingchen Li , Xin Li , Yiting Lu , Ruoyu Feng , Mengxi Guo , Shijie Zhao , Li Zhang , Zhibo Chen

Perceptual image compression has shown strong potential for producing visually appealing results at low bitrates, surpassing classical standards and pixel-wise distortion-oriented neural methods. However, existing methods typically improve…

Image and Video Processing · Electrical Eng. & Systems 2025-02-21 Hao Wei , Yanhui Zhou , Yiwen Jia , Chenyang Ge , Saeed Anwar , Ajmal Mian

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

The quadratic cost of attention in transformers motivated the development of efficient approaches: namely sparse and sliding window attention, convolutions and linear attention. Although these approaches result in impressive reductions in…

Machine Learning · Computer Science 2025-11-10 Jatin Prakash , Aahlad Puli , Rajesh Ranganath

Large Language Models are growing in size, and we expect them to continue to do so, as larger models train quicker. However, this increase in size will severely impact inference costs. Therefore model compression is important, to retain the…

Machine Learning · Computer Science 2024-04-10 Georgy Tyukin

Approaches for compressing large-language models using low-rank decomposition have made strides, particularly with the introduction of activation and loss-aware SVD, which improves the trade-off between decomposition rank and downstream…

Machine Learning · Computer Science 2025-12-17 Sidhant Sundrani , Francesco Tudisco , Pasquale Minervini

LLM-based automatic speech recognition (ASR), a well-established approach, connects speech foundation models to large language models (LLMs) through a speech-to-LLM projector, yielding promising results. A common design choice in these…