ProCut: LLM Prompt Compression via Attribution Estimation
On the map: Efficient LLM inference and serving → Prompt and context compression
Abstract (arXiv)
In large-scale industrial LLM systems, prompt templates often expand to thousands of tokens as teams iteratively incorporate sections such as task instructions, few-shot examples, and heuristic rules to enhance robustness and coverage. This expansion leads to bloated prompts that are difficult to maintain and incur significant inference latency and serving costs. To address this, we introduce Prompt Compression via Attribution Estimation (ProCut), a flexible, LLM-agnostic, training-free framework that compresses prompts through attribution analysis. ProCut segments prompt templates into semantically meaningful units, quantifies their impact on task performance, and prunes low-utility components. Through extensive experiments on five public benchmark datasets and real-world industrial prompts, we show that ProCut achieves substantial prompt size reductions (78% fewer tokens in production) while maintaining or even slightly improving task performance (up to 62% better than alternative methods). We further introduce an LLM-driven attribution estimator that reduces compression latency by over 50%, and demonstrate that ProCut integrates seamlessly with existing prompt-optimization frameworks to produce concise, high-performing prompts.
Key facts. Cited by 6 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 26 of its 61 references that are in the map. First posted on arXiv 4 Aug 2025.
Builds on
26 of 61 references.
Closest ancestors · 4
Same direction, newest first
- 2025EFPC: Towards Efficient and Flexible Prompt Compression11 Mar
- 2024Style-Compress: An LLM-Based Prompt Compression Framework Considering Task-Specific Styles17 Oct
- 2024Selection-p: Self-Supervised Task-Agnostic Prompt Compression for Faithfulness and Transferability15 Oct
- 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression19 Mar
Other references · 22
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
- 2022Large Language Models are Zero-Shot Reasonerscited by 4,374
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
- 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,455
- 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
- 2016Distribution-Free Predictive Inference For Regressioncited by 668
- 2023Automatic Prompt Optimization with "Gradient Descent" and Beam Searchcited by 653
- 2023Learning to Compress Prompts with Gist Tokenscited by 390
- 2022Complexity-Based Prompting for Multi-Step Reasoningcited by 388
- 2023Adapting Language Models to Compress Contextscited by 356
10 more
- 2023Large Language Models for Information Retrieval: A Surveycited by 331
- 2022Large Language Models Meet NL2Code: A Surveycited by 138
- 2024Debug like a Human: A Large Language Model Debugger via Verifying Runtime Execution Step-by-stepcited by 127
- 2023Chain-of-Thought Hub: A Continuous Effort to Measure Large Language Models' Reasoning Performancecited by 102
- 2025A Systematic Survey of Automatic Prompt Optimization Techniquescited by 63
- 2023Coverage-based Example Selection for In-Context Learningcited by 59
- 2024Learning to Compress Prompt in Natural Language Formatscited by 55
- 2023Learning to Rewrite Prompts for Personalized Text Generationcited by 40
- 2024GReaTer: Gradients over Reasoning Makes Smaller Language Models Strong Prompt Optimizerscited by 12
- 2023Estimating Large Language Model Capabilities without Labeled Test Datacited by 9
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026Segment-Level Attribution for Selective Learning of Long Reasoning Tracescited by 1
- 2026SPEAR: Code-Augmented Agentic Prompt Optimizationcited by 1
- 2026Cost-Governed RAG: Unified Per-Tenant Cost Attribution Across Retrieval and Generation in Multi-Tenant LLM Systemscited by 1
- 2026Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Cachingcited by 1
- 2026Every Time I Hire a Linguist, Inference Costs Go Down: On Linguistic Rules as Effective Prompt Compressorscited by 0
- 2026Distilling Sequential Computation in Transformer Language Modelscited by 0
- 2026Distilling Sequential Computation in Transformer Language Models23 Sep 2026
- 2026Every Time I Hire a Linguist, Inference Costs Go Down: On Linguistic Rules as Effective Prompt Compressors28 Jul 2026
- 2026Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching17 Jul 2026
- 2026Cost-Governed RAG: Unified Per-Tenant Cost Attribution Across Retrieval and Generation in Multi-Tenant LLM Systems13 Jul 2026
- 2026SPEAR: Code-Augmented Agentic Prompt Optimization25 May 2026
- 2026Segment-Level Attribution for Selective Learning of Long Reasoning Traces31 Jan 2026
Similar, not cited
Close in wording, no citation either way
- 2025CompactPrompt: A Unified Pipeline for Prompt Data Compression in LLM Workflows
- 2026Prompt Compression in Production Task Orchestration: A Pre-Registered Randomized Trial
- 2026ClusterFewshot: Improving Few-shot Optimization for LLMs workflow
- 2026Prompt Minimization: Reducing Input Redundancy Without Sacrificing Output Fidelity
- 2025Rethinking Prompt Optimizers: From Prompt Merits to Optimization
- 2026Prompt Compression in the Wild: Measuring Latency, Rate Adherence, and Quality for Faster LLM Inference
- 2025Understanding and Improving Information Preservation in Prompt Compression for LLMs
- 2026Learning from Prompt itself: the Hierarchical Attribution Prompt Optimization