Style-Compress: An LLM-Based Prompt Compression Framework Considering Task-Specific Styles
On the map: Efficient LLM inference and serving → Prompt and context compression
Abstract (arXiv)
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 expenses when using closed-source models. In a preliminary study, we discover that when instructing language models to compress prompts, different compression styles (e.g., extractive or abstractive) impact performance of compressed prompts on downstream tasks. Building on this insight, we propose Style-Compress, a lightweight framework that adapts a smaller language model to compress prompts for a larger model on a new task without additional training. Our approach iteratively generates and selects effective compressed prompts as task-specific demonstrations through style variation and in-context learning, enabling smaller models to act as efficient compressors with task-specific examples. Style-Compress outperforms two baseline compression models in four tasks: original prompt reconstruction, text summarization, multi-hop QA, and CoT reasoning. In addition, with only 10 samples and 100 queries for adaptation, prompts compressed by Style-Compress achieve performance on par with or better than original prompts at a compression ratio of 0.25 or 0.5.
Key facts. Cited by 9 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 13 of its 22 references that are in the map. First posted on arXiv 17 Oct 2024.
Builds on
13 of 22 references.
Closest ancestors · 2
Same direction, newest first
- 2023Discrete Prompt Compression with Reinforcement Learning17 Aug
- 2022Prompt Compression and Contrastive Conditioning for Controllability and Toxicity Reduction in Language Models6 Oct
Other references · 11
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2019BERTScore: Evaluating Text Generation with BERTcited by 5,512
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
- 2017Get To The Point: Summarization with Pointer-Generator Networkscited by 1,292
- 2021Recent Advances in Natural Language Processing via Large Pre-Trained Language Models: A Surveycited by 463
- 2023Harnessing the Power of LLMs in Practice: A Survey on ChatGPT and Beyondcited by 411
- 2023Adapting Language Models to Compress Contextscited by 356
- 2023RECOMP: Improving Retrieval-Augmented LMs with Compression and Selective Augmentationcited by 256
- 2023Compressing Context to Enhance Inference Efficiency of Large Language Modelscited by 189
- 2023Did You Read the Instructions? Rethinking the Effectiveness of Task Definitions in Instruction Learningcited by 41
- 2023Efficient Prompting via Dynamic In-Context Learningcited by 18
Built on by
Citing papers per year: 2025: 7; 2026: 2.
9 papers.
- 2025A Survey of Multimodal Retrieval-Augmented Generationcited by 37
- 2025ProCut: LLM Prompt Compression via Attribution Estimationcited by 6
- 2025SCOPE: A Generative Approach for LLM Prompt Compressioncited by 6
- 2026Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compressioncited by 6
- 2025PIS: Linking Importance Sampling and Attention Mechanisms for Efficient Prompt Compressioncited by 4
- 2025Cmprsr: Abstractive Token-Level Question-Agnostic Prompt Compressorcited by 1
- 2025WindowKV: Task-Adaptive Group-Wise KV Cache Window Selection for Efficient LLM Inferencecited by 0
- 2025When Compression Becomes an Attack Surface: Black-Box Attacks on Prompt-Compressed LLM Agentscited by 0
- 2026Prompt Minimization: Reducing Input Redundancy Without Sacrificing Output Fidelitycited by 0
- 2026Prompt Minimization: Reducing Input Redundancy Without Sacrificing Output Fidelity25 Sep 2026
- 2026Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression9 Feb 2026
- 2025Cmprsr: Abstractive Token-Level Question-Agnostic Prompt Compressor15 Nov 2025
- 2025When Compression Becomes an Attack Surface: Black-Box Attacks on Prompt-Compressed LLM Agents27 Oct 2025
- 2025SCOPE: A Generative Approach for LLM Prompt Compression16 Aug 2025
- 2025ProCut: LLM Prompt Compression via Attribution Estimation4 Aug 2025
- 2025PIS: Linking Importance Sampling and Attention Mechanisms for Efficient Prompt Compression23 Apr 2025
- 2025A Survey of Multimodal Retrieval-Augmented Generation26 Mar 2025
- 2025WindowKV: Task-Adaptive Group-Wise KV Cache Window Selection for Efficient LLM Inference23 Mar 2025
Similar, not cited
Close in wording, no citation either way
- 2025Dynamic Compressing Prompts for Efficient Inference of Large Language Models
- 2024Fundamental Limits of Prompt Compression: A Rate-Distortion Framework for Black-Box Language Models
- 2025Understanding and Improving Information Preservation in Prompt Compression for LLMs
- 2024Prompt-SAW: Leveraging Relation-Aware Graphs for Textual Prompt Compression
- 2025Task-agnostic Prompt Compression with Context-aware Sentence Embedding and Reward-guided Task Descriptor
- 2024Prompt Compression for Large Language Models: A Survey
- 2026Prompt Compression via Activation Aggregation
- 2026Lexical Prompt Compression for Large Language Models: A Training-Free, Deterministic Pipeline with Empirical Pareto Analysis Across Eleven Task Categories