mlsanityData to 7 Oct 2026

SCOPE: A Generative Approach for LLM Prompt Compression

arXiv 2508.15813 ↗First posted 16 Aug 2025cs.CL cs.AIcited by 6

On the map: Efficient LLM inference and serving → Prompt and context compression

Abstract (arXiv)

A big issue in modern LLM applications is they tend to feed long context to LLM, which results in high inference cost and latency, and may exceed the context limit. Prompt compression addresses this issue by reducing the length of input context with minimum loss of generation quality, i.e, the goal of prompt compression is to shorten the LLM input while maintaining a high generation quality. To overcome these limitations, we propose SCOPE, a training-free generative prompt compression framework based on chunk-level rewriting. Unlike the existing token removal methods, our method centers at a chunking-and-summarization mechanism. Specifically, SCOPE splits a prompt into semantically coherent chunks and rewrites the chunks to be more concise. Then the chunks are reconstructed into a meaningful prompt. Additionally, we design several optimization techniques for SCOPE, effectively preserving critical information and text coherence in compression, as well as providing finer-grained control of the compression ratio. We conduct extensive evaluation on typical LLM applications like question-answering and summarization. Results show that SCOPE consistently outperforms the evaluated selective compression baselines across most settings, with particularly strong gains at high compression ratios.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Placed in Prompt and context compression, one of 12 directions in Efficient LLM inference and serving. Builds on 19 of its 27 references that are in the map. First posted on arXiv 16 Aug 2025.

Builds on

19 of 27 references.

Closest ancestors · 5

Same direction, newest first

  1. 2024Style-Compress: An LLM-Based Prompt Compression Framework Considering Task-Specific Styles17 Oct
  2. 2024Parse Trees Guided LLM Prompt Compression23 Sep
  3. 2024Prompt-SAW: Leveraging Relation-Aware Graphs for Textual Prompt Compression30 Mar
  4. 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression19 Mar
  5. 2023LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compression10 Oct

Other references · 14

  1. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
  2. 2019BERTScore: Evaluating Text Generation with BERTcited by 5,462
  3. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,895
  4. 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,378
  5. 2019PEGASUS: Pre-training with Extracted Gap-sentences for Abstractive Summarizationcited by 1,100
  6. 2018A Discourse-Aware Attention Model for Abstractive Summarization of Long Documentscited by 477
  7. 2021Efficient Attentions for Long Document Summarizationcited by 342
  8. 2023RECOMP: Improving Retrieval-Augmented LMs with Compression and Selective Augmentationcited by 253
  9. 2025Qwen2.5-1M Technical Reportcited by 158
  10. 2024RetrievalAttention: Accelerating Long-Context LLM Inference via Vector Retrievalcited by 114
  11. 2023Jina Embeddings 2: 8192-Token General-Purpose Text Embeddings for Long Documentscited by 103
  12. 2024CompAct: Compressing Retrieved Documents Actively for Question Answeringcited by 64
2 more
  1. 2023Unlocking Context Constraints of LLMs: Enhancing Context Efficiency of LLMs with Self-Information-Based Content Filteringcited by 62
  2. 2023PRCA: Fitting Black-Box Large Language Models for Retrieval Question Answering via Pluggable Reward-Driven Contextual Adaptercited by 38

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 4.

6 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024Prompt Compression with Context-Aware Sentence Encoding for Fast and Improved LLM Inference
  2. 2026Prompt Compression in the Wild: Measuring Latency, Rate Adherence, and Quality for Faster LLM Inference
  3. 2023LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Models
  4. 2025Understanding and Improving Information Preservation in Prompt Compression for LLMs
  5. 2024500xCompressor: Generalized Prompt Compression for Large Language Models
  6. 2026Lexical Prompt Compression for Large Language Models: A Training-Free, Deterministic Pipeline with Empirical Pareto Analysis Across Eleven Task Categories
  7. 2024Adapting LLMs for Efficient Context Processing through Soft Prompt Compression
  8. 2026PC-SubMax: Efficient Prompt Compression via Regularized Submodular Maximization