DAC: A Dynamic Attention-aware Approach for Task-Agnostic Prompt Compression
On the map: Efficient LLM inference and serving → Prompt and context compression
Abstract (arXiv)
Task-agnostic prompt compression leverages the redundancy in natural language to reduce computational overhead and enhance information density within prompts, especially in long-context scenarios. Existing methods predominantly rely on information entropy as the metric to compress lexical units, aiming to achieve minimal information loss. However, these approaches overlook two critical aspects: (i) the importance of attention-critical tokens at the algorithmic level, and (ii) shifts in information entropy during the compression process. Motivated by these challenges, we propose a dynamic attention-aware approach for task-agnostic prompt compression (DAC). This approach effectively integrates entropy and attention information, dynamically sensing entropy shifts during compression to achieve fine-grained prompt compression. Extensive experiments across various domains, including LongBench, GSM8K, and BBH, show that DAC consistently yields robust and substantial improvements across a diverse range of tasks and LLMs, offering compelling evidence of its efficacy.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Placed in Prompt and context compression, one of 12 directions in Efficient LLM inference and serving. Builds on 20 of its 25 references that are in the map. First posted on arXiv 16 Jul 2025.
Builds on
20 of 25 references.
Closest ancestors · 4
Same direction, newest first
- 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression19 Mar
- 2023LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compression10 Oct
- 2023Discrete Prompt Compression with Reinforcement Learning17 Aug
- 2022Prompt Compression and Contrastive Conditioning for Controllability and Toxicity Reduction in Language Models6 Oct
Other references · 16
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,297
- 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
- 2023The Rise and Potential of Large Language Model Based Agents: A Surveycited by 1,439
- 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,417
- 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
- 2022A Survey on In-context Learningcited by 721
- 2023Scissorhands: Exploiting the Persistence of Importance Hypothesis for LLM KV Cache Compression at Test Timecited by 439
- 2023Learning to Compress Prompts with Gist Tokenscited by 390
- 2023RECOMP: Improving Retrieval-Augmented LMs with Compression and Selective Augmentationcited by 256
- 2024PyramidInfer: Pyramid KV Cache Compression for High-throughput LLM Inferencecited by 147
4 more
- 2024You Only Cache Once: Decoder-Decoder Architectures for Language Modelscited by 144
- 2024Keep the Cost Down: A Review on Methods to Optimize LLM' s KV-Cache Consumptioncited by 97
- 2023Igniting Language Intelligence: The Hitchhiker's Guide From Chain-of-Thought Reasoning to Language Agentscited by 72
- 2024KVSharer: Efficient Inference via Layer-Wise Dissimilar KV Cache Sharingcited by 41
Built on by
Citing papers per year: 2025: 4; 2026: 3.
7 papers.
- 2025CompLLM: Compression for Long Context Q&Acited by 5
- 2025Scaling LLM Speculative Decoding: Non-Autoregressive Forecasting in Large-Batch Scenarioscited by 3
- 2025End-to-end Contrastive Language-Speech Pretraining Model For Long-form Spoken Question Answeringcited by 2
- 2026POP: Prefill-Only Pruning for Efficient Large Model Inferencecited by 2
- 2025Cmprsr: Abstractive Token-Level Question-Agnostic Prompt Compressorcited by 1
- 2026Relevant but Incomplete: Referential Dangling as a Paradigm-Level Failure Mode in Hard Prompt Compressioncited by 0
- 2026Compression Beyond the Uncompressed: A Two-Stage Training Recipe for Soft Context Compression in RAGcited by 0
- 2026Compression Beyond the Uncompressed: A Two-Stage Training Recipe for Soft Context Compression in RAG4 Sep 2026
- 2026Relevant but Incomplete: Referential Dangling as a Paradigm-Level Failure Mode in Hard Prompt Compression5 Aug 2026
- 2026POP: Prefill-Only Pruning for Efficient Large Model Inference3 Feb 2026
- 2025Scaling LLM Speculative Decoding: Non-Autoregressive Forecasting in Large-Batch Scenarios25 Nov 2025
- 2025Cmprsr: Abstractive Token-Level Question-Agnostic Prompt Compressor15 Nov 2025
- 2025End-to-end Contrastive Language-Speech Pretraining Model For Long-form Spoken Question Answering12 Nov 2025
- 2025CompLLM: Compression for Long Context Q&A23 Sep 2025
Similar, not cited
Close in wording, no citation either way
- 2025Task-agnostic Prompt Compression with Context-aware Sentence Embedding and Reward-guided Task Descriptor
- 2025Understanding and Improving Information Preservation in Prompt Compression for LLMs
- 2024Prompt Compression for Large Language Models: A Survey
- 2024Style-Compress: An LLM-Based Prompt Compression Framework Considering Task-Specific Styles
- 2026Lexical Prompt Compression for Large Language Models: A Training-Free, Deterministic Pipeline with Empirical Pareto Analysis Across Eleven Task Categories
- 2024Prompt-SAW: Leveraging Relation-Aware Graphs for Textual Prompt Compression
- 2025Better Prompt Compression Without Multi-Layer Perceptrons
- 2024Fundamental Limits of Prompt Compression: A Rate-Distortion Framework for Black-Box Language Models