mlsanityData to 7 Oct 2026

Prompt Compression in Production Task Orchestration: A Pre-Registered Randomized Trial

arXiv 2603.23525 ↗First posted 6 Mar 2026cs.CLcited by 1

On the map: Efficient LLM inference and serving → Efficient reasoning and agent inference

Abstract (arXiv)

The economics of prompt compression depend not only on reducing input tokens but on how compression changes output length, which is typically priced several times higher. We evaluate this in a pre-registered six-arm randomized controlled trial of prompt compression on production multi-agent task-orchestration, analyzing 358 successful Claude Sonnet 4.5 runs (59-61 per arm) drawn from a randomized corpus of 1,199 real orchestration instructions. We compare an uncompressed control with three uniform retention rates (r=0.8, 0.5, 0.2) and two structure-aware strategies (entropy-adaptive and recency-weighted), measuring total inference cost (input+output) and embedding-based response similarity. Moderate compression (r=0.5) reduced mean total cost by 27.9%, while aggressive compression (r=0.2) increased mean cost by 1.8% despite substantial input reduction, consistent with small mean output expansion (1.03x vs. control) and heavy-tailed uncertainty. Recency-weighted compression achieved 23.5% savings and, together with moderate compression, occupied the empirical cost-similarity Pareto frontier, whereas aggressive compression was dominated on both cost and similarity. These results show that "compress more" is not a reliable production heuristic and that output tokens must be treated as a first-class outcome when designing compression policies.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Efficient reasoning and agent inference, one of 12 directions in Efficient LLM inference and serving. Builds on 30 of its 58 references that are in the map. First posted on arXiv 6 Mar 2026.

Builds on

30 of 58 references.

Closest ancestors · 1

Same direction, newest first

  1. 2026The Perplexity Paradox: Why Code Compresses Better Than Math in LLM Prompts21 Jan

Other references · 29

  1. 2023GPT-4 Technical Reportcited by 18,132
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  3. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  4. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
  5. 2019BERTScore: Evaluating Text Generation with BERTcited by 5,462
  6. 2021Program Synthesis with Large Language Modelscited by 3,509
  7. 2023Generative Agents: Interactive Simulacra of Human Behaviorcited by 3,500
  8. 2023A Survey on Large Language Model based Autonomous Agentscited by 2,203
  9. 2023AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversationcited by 1,906
  10. 2023MetaGPT: Meta Programming for A Multi-Agent Collaborative Frameworkcited by 1,761
  11. 2023The Rise and Potential of Large Language Model Based Agents: A Surveycited by 1,422
  12. 2023ChatDev: Communicative Agents for Software Developmentcited by 893
17 more
  1. 2024SnapKV: LLM Knows What You are Looking for Before Generationcited by 848
  2. 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Modelscited by 805
  3. 2023Semantic Uncertainty: Linguistic Invariances for Uncertainty Estimation in Natural Language Generationcited by 795
  4. 2023FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performancecited by 791
  5. 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 633
  6. 2023LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compressioncited by 443
  7. 2023Learning to Compress Prompts with Gist Tokenscited by 379
  8. 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 354
  9. 2023Adapting Language Models to Compress Contextscited by 350
  10. 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compressioncited by 343
  11. 2023LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Modelscited by 279
  12. 2023RECOMP: Improving Retrieval-Augmented LMs with Compression and Selective Augmentationcited by 253
  13. 2023In-context Autoencoder for Context Compression in a Large Language Modelcited by 190
  14. 2023Compressing Context to Enhance Inference Efficiency of Large Language Modelscited by 185
  15. 2020Challenges in Deploying Machine Learning: a Survey of Case Studiescited by 151
  16. 2023TaskBench: Benchmarking Large Language Models for Task Automationcited by 138
  17. 2022Prompt Compression and Contrastive Conditioning for Controllability and Toxicity Reduction in Language Modelscited by 96

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025ProCut: LLM Prompt Compression via Attribution Estimation
  2. 2026Control Under Compression: Reliability Frontiers for Tool-Using Agents
  3. 2026What Does Context Compression Cost an Agent? Interaction Costs Unrevealed by Task-Completion Metrics
  4. 2026An Empirical Cost Attribution of Context-Compression Gateways in Multi-Turn Coding Agents
  5. 2026Adapting Context Compression for Long-Horizon Agents with Counterfactual Continuations
  6. 2026Beyond Token Savings: A Systematic Study of Context Compression in LLM Agents
  7. 2026Compression Method Matters: Benchmark-Dependent Output Dynamics in LLM Prompt Compression
  8. 2025Understanding and Improving Information Preservation in Prompt Compression for LLMs