TACO-RL: Task Aware Prompt Compression Optimization with Reinforcement Learning
On the map: Efficient LLM inference and serving → Prompt and context compression
Abstract (arXiv)
The increasing prevalence of large language models (LLMs) such as GPT-4 in various applications has led to a surge in the size of prompts required for optimal performance, leading to challenges in computational efficiency. Prompt compression aims to reduce the inference cost by minimizing input tokens without compromising on the task performance. However, existing prompt compression techniques either rely on sub-optimal metrics such as information entropy or model it as a task-agnostic token classification problem that fails to capture task-specific information. To address these issues, we propose a novel and efficient reinforcement learning (RL) based task-aware prompt compression method. To ensure low latency requirements, we leverage existing Transformer encoder-based token classification model while guiding the learning process with task-specific reward signals using lightweight REINFORCE algorithm. We evaluate the performance of our method on three diverse and challenging tasks including text summarization, question answering and code summarization. We demonstrate that our RL-guided compression method improves the task performance by 8% - 189% across these three scenarios over state-of-the-art compression techniques while satisfying the same compression rate and latency requirements.
Key facts. Cited by 22 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 25 of its 36 references that are in the map. First posted on arXiv 19 Sep 2024.
Builds on
25 of 36 references.
Closest ancestors · 2
Same direction, newest first
- 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression19 Mar
- 2023Discrete Prompt Compression with Reinforcement Learning17 Aug
Other references · 23
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2023GPT-4 Technical Reportcited by 18,132
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2019BERTScore: Evaluating Text Generation with BERTcited by 5,462
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
11 more
- 2019Unsupervised Cross-lingual Representation Learning at Scalecited by 3,907
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2019CodeSearchNet Challenge: Evaluating the State of Semantic Code Searchcited by 638
- 2023Learning to Compress Prompts with Gist Tokenscited by 379
- 2023Compressing Context to Enhance Inference Efficiency of Large Language Modelscited by 185
- 2023MeetingBank: A Benchmark Dataset for Meeting Summarizationcited by 81
- 2024Learning to Compress Prompt in Natural Language Formatscited by 54
- 2024Automated Root Causing of Cloud Incidents using In-Context Learning with GPT-4cited by 28
- 2023Fewer is More: Boosting LLM Reasoning with Reinforced Context Pruningcited by 26
- 2024X-lifecycle Learning for Cloud Incident Management using LLMscited by 19
- 2023An Empirical Comparison of LM-based Question and Answer Generation Methodscited by 15
Built on by
Citing papers per year: 2024: 1; 2025: 9; 2026: 12.
22 papers.
Sort:
By area:
- 2024Prompt Compression for Large Language Models: A Surveycited by 65
- 2025A Survey of Multimodal Retrieval-Augmented Generationcited by 37
- 2025Beyond Hard and Soft: Hybrid Context Compression for Balancing Local and Global Information Retentioncited by 7
- 2025Dynamic Compressing Prompts for Efficient Inference of Large Language Modelscited by 6
- 2025What Makes a Good Natural Language Prompt?cited by 6
- 2026Toward Reliable Context Compression for Long-Horizon Agents: An Empirical Study of Execution Instabilitycited by 5
- 2025PIS: Linking Importance Sampling and Attention Mechanisms for Efficient Prompt Compressioncited by 4
- 2025Lossless Token Sequence Compression via Meta-Tokenscited by 4
- 2025How to Auto-optimize Prompts for Domain Tasks? Adaptive Prompting and Reasoning through Evolutionary Domain Knowledge Adaptationcited by 4
- 2026What to Keep, What to Forget: A Rate--Distortion View of Memory Compaction in LLMs and Agentscited by 4
- 2026The Perplexity Paradox: Why Code Compresses Better Than Math in LLM Promptscited by 2
- 2026BEAVER: A Training-Free Hierarchical Prompt Compression Method via Structure-Aware Page Selectioncited by 2
10 more
- 2026DiffuMask: Diffusion Language Model for Token-level Prompt Pruningcited by 1
- 2025WindowKV: Task-Adaptive Group-Wise KV Cache Window Selection for Efficient LLM Inferencecited by 0
- 2025Cmprsr: Abstractive Token-Level Question-Agnostic Prompt Compressorcited by 0
- 2026Seq2Seq2Seq: Lossless Data Compression via Discrete Latent Transformers and Reinforcement Learningcited by 0
- 2026A Unified Model and Document Representation for On-Device Retrieval-Augmented Generationcited by 0
- 2026Compressing Sequences in the Latent Embedding Space: K-Token Merging for Large Language Modelscited by 0
- 2026Relevant but Incomplete: Referential Dangling as a Paradigm-Level Failure Mode in Hard Prompt Compressioncited by 0
- 2026Protocol-Preserving Context Trimming for Agentic Workflows: Benefits, Failure Regimes, and Budget Guardrailscited by 0
- 2026MORSE: Multi-Context Ordering via Reverse Scoring for Evidence-Preserving Compressioncited by 0
- 2026Adapting Context Compression for Long-Horizon Agents with Counterfactual Continuationscited by 0
- 2026Adapting Context Compression for Long-Horizon Agents with Counterfactual Continuations29 Sep 2026
- 2026MORSE: Multi-Context Ordering via Reverse Scoring for Evidence-Preserving Compression23 Sep 2026
- 2026Protocol-Preserving Context Trimming for Agentic Workflows: Benefits, Failure Regimes, and Budget Guardrails15 Sep 2026
- 2026Toward Reliable Context Compression for Long-Horizon Agents: An Empirical Study of Execution Instability6 Aug 2026
- 2026Relevant but Incomplete: Referential Dangling as a Paradigm-Level Failure Mode in Hard Prompt Compression5 Aug 2026
- 2026What to Keep, What to Forget: A Rate--Distortion View of Memory Compaction in LLMs and Agents9 Jul 2026
- 2026Compressing Sequences in the Latent Embedding Space: K-Token Merging for Large Language Models16 Apr 2026
- 2026A Unified Model and Document Representation for On-Device Retrieval-Augmented Generation15 Apr 2026
- 2026DiffuMask: Diffusion Language Model for Token-level Prompt Pruning8 Apr 2026
- 2026BEAVER: A Training-Free Hierarchical Prompt Compression Method via Structure-Aware Page Selection20 Mar 2026
- 2026Seq2Seq2Seq: Lossless Data Compression via Discrete Latent Transformers and Reinforcement Learning12 Feb 2026
- 2026The Perplexity Paradox: Why Code Compresses Better Than Math in LLM Prompts21 Jan 2026
10 more
- 2025Cmprsr: Abstractive Token-Level Question-Agnostic Prompt Compressor15 Nov 2025
- 2025How to Auto-optimize Prompts for Domain Tasks? Adaptive Prompting and Reasoning through Evolutionary Domain Knowledge Adaptation24 Oct 2025
- 2025What Makes a Good Natural Language Prompt?7 Jun 2025
- 2025Lossless Token Sequence Compression via Meta-Tokens30 May 2025
- 2025Beyond Hard and Soft: Hybrid Context Compression for Balancing Local and Global Information Retention21 May 2025
- 2025PIS: Linking Importance Sampling and Attention Mechanisms for Efficient Prompt Compression23 Apr 2025
- 2025Dynamic Compressing Prompts for Efficient Inference of Large Language Models15 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
- 2024Prompt Compression for Large Language Models: A Survey16 Oct 2024
- 2024Prompt Compression for Large Language Models: A Surveycited by 65
- 2025Beyond Hard and Soft: Hybrid Context Compression for Balancing Local and Global Information Retentioncited by 7
- 2025Dynamic Compressing Prompts for Efficient Inference of Large Language Modelscited by 6
- 2026Toward Reliable Context Compression for Long-Horizon Agents: An Empirical Study of Execution Instabilitycited by 5
- 2025PIS: Linking Importance Sampling and Attention Mechanisms for Efficient Prompt Compressioncited by 4
- 2025Lossless Token Sequence Compression via Meta-Tokenscited by 4
- 2026BEAVER: A Training-Free Hierarchical Prompt Compression Method via Structure-Aware Page Selectioncited by 2
- 2025WindowKV: Task-Adaptive Group-Wise KV Cache Window Selection for Efficient LLM Inferencecited by 0
- 2025Cmprsr: Abstractive Token-Level Question-Agnostic Prompt Compressorcited by 0
- 2026Compressing Sequences in the Latent Embedding Space: K-Token Merging for Large Language Modelscited by 0
- 2026Relevant but Incomplete: Referential Dangling as a Paradigm-Level Failure Mode in Hard Prompt Compressioncited by 0
- 2026Adapting Context Compression for Long-Horizon Agents with Counterfactual Continuationscited by 0
- 2026Adapting Context Compression for Long-Horizon Agents with Counterfactual Continuations29 Sep 2026
- 2026Toward Reliable Context Compression for Long-Horizon Agents: An Empirical Study of Execution Instability6 Aug 2026
- 2026Relevant but Incomplete: Referential Dangling as a Paradigm-Level Failure Mode in Hard Prompt Compression5 Aug 2026
- 2026Compressing Sequences in the Latent Embedding Space: K-Token Merging for Large Language Models16 Apr 2026
- 2026BEAVER: A Training-Free Hierarchical Prompt Compression Method via Structure-Aware Page Selection20 Mar 2026
- 2025Cmprsr: Abstractive Token-Level Question-Agnostic Prompt Compressor15 Nov 2025
- 2025Lossless Token Sequence Compression via Meta-Tokens30 May 2025
- 2025Beyond Hard and Soft: Hybrid Context Compression for Balancing Local and Global Information Retention21 May 2025
- 2025PIS: Linking Importance Sampling and Attention Mechanisms for Efficient Prompt Compression23 Apr 2025
- 2025Dynamic Compressing Prompts for Efficient Inference of Large Language Models15 Apr 2025
- 2025WindowKV: Task-Adaptive Group-Wise KV Cache Window Selection for Efficient LLM Inference23 Mar 2025
- 2024Prompt Compression for Large Language Models: A Survey16 Oct 2024
- 2025How to Auto-optimize Prompts for Domain Tasks? Adaptive Prompting and Reasoning through Evolutionary Domain Knowledge Adaptationcited by 4
- 2026The Perplexity Paradox: Why Code Compresses Better Than Math in LLM Promptscited by 2
- 2026DiffuMask: Diffusion Language Model for Token-level Prompt Pruningcited by 1
- 2026DiffuMask: Diffusion Language Model for Token-level Prompt Pruning8 Apr 2026
- 2026The Perplexity Paradox: Why Code Compresses Better Than Math in LLM Prompts21 Jan 2026
- 2025How to Auto-optimize Prompts for Domain Tasks? Adaptive Prompting and Reasoning through Evolutionary Domain Knowledge Adaptation24 Oct 2025
Similar, not cited
Close in wording, no citation either way
- 2025Task-agnostic Prompt Compression with Context-aware Sentence Embedding and Reward-guided Task Descriptor
- 2026ZipRL: Adaptive Multi-Turn Context Compression with Hindsight Response Replay
- 2026TAPR: Enhancing LLM Performance with a Task-Aware Prompt Rewriter
- 2025MARC: Memory-Augmented RL Token Compression for Efficient Video Understanding
- 2024LanguaShrink: Reducing Token Overhead with Psycholinguistics
- 2025DAC: A Dynamic Attention-aware Approach for Task-Agnostic Prompt Compression
- 2026HMPO: Hybrid Median-length Policy Optimization for Chain-of-Thought Compression
- 2024Entropy-Regularized Token-Level Policy Optimization for Language Agent Reinforcement