DisComp: A Two-Stage Prompt Optimization Framework Combining Task-Agnostic and Task-Aware Compression (2025.findings-naacl)
Copied to clipboard
| Challenge: | Extended prompts can lead to substantial computational overhead and increased hardware demands, limiting the scalability and efficiency of large language models. |
| Approach: | They propose a two-stage prompt compression framework that combines task-agnostic and task-based strategies to efficiently compress prompt length without compromising performance. |
| Outcome: | The proposed framework outperforms task-agnostic and task-specific compression methods on three benchmark datasets and is up to 6.56 faster at inference compared to the best token-level compression method. |
Similar Papers
LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression (2024.findings-acl)
Copied to clipboard
Zhuoshi Pan, Qianhui Wu, Huiqiang Jiang, Menglin Xia, Xufang Luo, Jue Zhang, Qingwei Lin, Victor Rühle, Yuqing Yang, Chin-Yew Lin, H. Vicky Zhao, Lili Qiu, Dongmei Zhang
| Challenge: | Existing approaches to compress prompts only leverage unidirectional context, causing suboptimal results. |
| Approach: | They propose a task-agnostic prompt compression method that takes tokens from context . they use a Transformer encoder to capture all essential information needed for prompt compression . |
| Outcome: | The proposed method is 3x-6x faster than existing prompt compression methods and faster than baselines. |
Understanding and Improving Information Preservation in Prompt Compression for LLMs (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Recent advances in large language models have enabled their successful application to a broad range of tasks. |
| Approach: | They propose a framework that allows for in-depth analysis of prompt compression methods. |
| Outcome: | The proposed framework analyzes state-of-the-art soft and hard compression methods . it shows that some fail to preserve key details from the original prompt, limiting performance on complex tasks. |
DAC: A Dynamic Attention-aware Approach for Task-Agnostic Prompt Compression (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods rely on information entropy as the metric to compress lexical units, but ignore attention-critical tokens and information . recent advent of In-Context Learning (ICL), Chain-of-Thought (CoT), and Retrieval Augmented Generation (RAG) technologies has significantly invigorated the landscape of applications based on Large Language Models (LLMs). |
| Approach: | They propose a dynamic attention-aware approach to task-agnostic prompt compression . they integrate entropy and attention information to achieve fine-grained prompt compression. |
| Outcome: | Experiments show that the proposed approach improves across tasks and LLMs. |
Style-Compress: An LLM-Based Prompt Compression Framework Considering Task-Specific Styles (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Prompt compression reduces inference time and costs while maintaining informativeness for different usage scenarios. |
| Approach: | They propose a framework that adapts a smaller language model to compress prompts for a larger model on a new task without additional training. |
| Outcome: | The proposed framework outperforms two baseline models in four tasks . iteratively generates and selects effective compressed prompts as task-specific demonstrations . |
LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Models (2023.emnlp-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) are increasingly lengthy and require longer prompts . this paper presents a coarse-to-fine prompt compression method to reduce cost and increase performance. |
| Approach: | They propose a coarse-to-fine prompt compression method that maintains semantic integrity under high compression ratios and a token-level iterative compression algorithm to better model the interdependence between compressed contents. |
| Outcome: | The proposed method yields state-of-the-art performance and allows for up to 20x compression with little performance loss over four datasets from different scenarios. |
Perception Compressor: A Training-Free Prompt Compression Framework in Long Context Scenarios (2025.findings-naacl)
Copied to clipboard
| Challenge: | Long prompts contain redundant information and are sensitive to the position of key information in long context scenarios. |
| Approach: | They propose a training-free prompt compression framework that retains key information at token level while removing distracting tokens. |
| Outcome: | The proposed framework outperforms existing methods on long context benchmarks. |
Learning to Compress Prompt in Natural Language Formats (2024.naacl-long)
Copied to clipboard
| Challenge: | Existing work rely on compressing long contexts into soft prompts, but soft prompt compression encounters limitations in transferability . natural language (NL) prompts are incompatible with back-propagation, and NL prompts lack flexibility in imposing length constraints. |
| Approach: | They propose a framework that compresses long prompts into NL formatted Capsule Prompts. |
| Outcome: | The proposed framework reduces 81.4% of the original length, decreases inference latency up to 4.5x, and saves 80.1% of budget overheads while providing transferability across diverse LLMs and different datasets. |
Prompt Compression for Large Language Models: A Survey (2025.naacl-long)
Copied to clipboard
| Challenge: | Current methods for improving LLM efficiency focus on optimizing the model itself, while prompt-centric methods focus on lowering the complexity of input. |
| Approach: | They propose to use prompt compression to optimize the compression encoder and combine hard and soft prompt methods to improve the efficiency of LLMs. |
| Outcome: | The proposed methods are categorized into hard prompt methods and soft prompt methods. |
LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compression (2024.acl-long)
Copied to clipboard
| Challenge: | Longer prompts introduce irrelevant and redundant information, which can weaken LLMs' performance. |
| Approach: | They propose a prompt compression tool that improves LLMs' perception of key information in input prompts by up to 21.4% with around 4x fewer tokens in GPT-3.5-Turbo. |
| Outcome: | The proposed solution improves performance and reduces costs and latency by up to 21.4% with around 4x fewer tokens in the NaturalQuestions benchmark. |
ProCut: LLM Prompt Compression via Attribution Estimation (2025.emnlp-industry)
Copied to clipboard
| Challenge: | ProCut compresses prompts using attribution analysis to reduce prompt size and latency. |
| Approach: | They propose a framework that compresses prompts through attribution analysis using a heuristic and attribution-based attribution model. |
| Outcome: | The proposed framework reduces prompt size by 78% while maintaining or improving task performance by 62%. |