Style-Compress: An LLM-Based Prompt Compression Framework Considering Task-Specific Styles

Xiao Pu, Tianxing He, Xiaojun Wan
10/17/2024
cs.CL

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{pu2024stylecompress,
  title  = {Style-Compress: An LLM-Based Prompt Compression Framework Considering Task-Specific Styles},
  author = {Xiao Pu and Tianxing He and Xiaojun Wan},
  year   = {2024},
  eprint = {2410.14042},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.14042v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.14042.svg)](https://codeofpaper.com/paper/2410.14042)

Discussion