Efficient Prompt Compression with Evaluator Heads for Long-Context Transformer Inference
On the map: Efficient LLM inference and serving → Prompt and context compression
Abstract (arXiv)
Although applications involving long-context inputs are crucial for the effective utilization of large language models (LLMs), they also result in increased computational costs and reduced performance. To address this challenge, we propose an efficient, training-free prompt compression method that retains key information within compressed prompts. We identify specific attention heads in transformer-based LLMs, which we designate as evaluator heads, that are capable of selecting tokens in long inputs that are most significant for inference. Building on this discovery, we develop EHPC, an Evaluator Head-based Prompt Compression method, which enables LLMs to rapidly "skim through" input prompts by leveraging only the first few layers with evaluator heads during the pre-filling stage, subsequently passing only the important tokens to the model for inference. EHPC achieves state-of-the-art results across two mainstream benchmarks: prompt compression and long-context inference acceleration. Consequently, it effectively reduces the complexity and costs associated with commercial API calls. We further demonstrate that EHPC attains competitive results compared to key-value cache-based acceleration methods, thereby highlighting its potential to enhance the efficiency of LLMs for long-context tasks.
Key facts. Cited by 10 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 54 of its 59 references that are in the map. First posted on arXiv 22 Jan 2025.
Builds on
54 of 59 references.
Closest ancestors · 6
Same direction, newest first
- 2024Prompt Compression with Context-Aware Sentence Encoding for Fast and Improved LLM Inference2 Sep
- 2024Characterizing Prompt Compression Methods for Long Context Inference11 Jul
- 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression19 Mar
- 2023LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compression10 Oct
- 2023In-context Autoencoder for Context Compression in a Large Language Model13 Jul
- 2022Prompt Compression and Contrastive Conditioning for Controllability and Toxicity Reduction in Language Models6 Oct
Other references · 48
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,686
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,378
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,270
- 2020Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Stepscited by 1,259
- 2021MuSiQue: Multihop Questions via Single-hop Question Compositioncited by 893
- 2024SnapKV: LLM Knows What You are Looking for Before Generationcited by 848
- 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Modelscited by 805
- 2024DistServe: Disaggregating Prefill and Decoding for Goodput-optimized Large Language Model Servingcited by 595
- 2017The NarrativeQA Reading Comprehension Challengecited by 590
36 more
- 2021A Dataset of Information-Seeking Questions and Answers Anchored in Research Paperscited by 475
- 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMscited by 466
- 2023Benchmarking Large Language Models for News Summarizationcited by 444
- 2019Multi-News: a Large-Scale Multi-Document Summarization Dataset and Abstractive Hierarchical Modelcited by 431
- 2023Scissorhands: Exploiting the Persistence of Importance Hypothesis for LLM KV Cache Compression at Test Timecited by 428
- 2024PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funnelingcited by 420
- 2023Learning to Compress Prompts with Gist Tokenscited by 379
- 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 375
- 2021QMSum: A New Benchmark for Query-based Multi-domain Meeting Summarizationcited by 363
- 2024∞Bench: Extending Long Context Evaluation Beyond 100K Tokenscited by 360
- 2023Adapting Language Models to Compress Contextscited by 350
- 2023RepoBench: Benchmarking Repository-Level Code Auto-Completion Systemscited by 346
- 2021Efficient Attentions for Long Document Summarizationcited by 342
- 2024DuoAttention: Efficient Long-Context LLM Inference with Retrieval and Streaming Headscited by 283
- 2023LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Modelscited by 279
- 2024Retrieval Head Mechanistically Explains Long-Context Factualitycited by 219
- 2024When Attention Sink Emerges in Language Models: An Empirical Viewcited by 200
- 2022Recurrent Memory Transformercited by 197
- 2023Compressing Context to Enhance Inference Efficiency of Large Language Modelscited by 185
- 2023ZeroSCROLLS: A Zero-Shot Benchmark for Long Text Understandingcited by 175
- 2024Keyformer: KV Cache Reduction through Key Tokens Selection for Efficient Generative Inferencecited by 124
- 2023LongCoder: A Long-Range Pre-trained Language Model for Code Completioncited by 110
- 2024RazorAttention: Efficient KV Cache Compression Through Retrieval Headscited by 99
- 2024LazyLLM: Dynamic Token Pruning for Efficient Long Context LLM Inferencecited by 70
- 2023Extending Context Window of Large Language Models via Semantic Compressioncited by 45
- 2024Discovering the Gems in Early Layers: Accelerating Long-Context LLMs with 1000x Input Token Reductioncited by 39
- 2024Can We Rely on LLM Agents to Draft Long-Horizon Plans? Let's Take TravelPlanner as an Examplecited by 22
- 2023Wasserstein-Fisher-Rao Embedding: Logical Query Embeddings with Local Comparison and Global Transportcited by 16
- 2024An LLM-Tool Compiler for Fused Parallel Function Callingcited by 14
- 2023Rethinking Complex Queries on Knowledge Graphs with Neural Link Predictorscited by 12
- 2023EFOk-CQA: Towards Knowledge Graph Complex Query Answering beyond Set Operationcited by 12
- 2024XC-Cache: Cross-Attending to Cached Context for Efficient LLM Inferencecited by 12
- 2024Beyond Scaling Laws: Understanding Transformer Performance with Associative Memorycited by 12
- 2024Retrieval Meets Reasoning: Dynamic In-Context Editing for Long-Text Understandingcited by 9
- 2024CritiPrefill: A Segment-wise Criticality-based Approach for Prefilling Acceleration in LLMscited by 7
- 2024Extending Complex Logical Queries on Uncertain Knowledge Graphscited by 2
Built on by
Citing papers per year: 2025: 2; 2026: 8.
10 papers.
- 2026DeltaEvolve: Accelerating Scientific Discovery through Momentum-Driven Evolutioncited by 23
- 2025SemShareKV: Efficient KVCache Sharing for Semantically Similar Prompts via Token-Level LSH Matchingcited by 6
- 2026Gated Differentiable Working Memory for Long-Context Language Modelingcited by 6
- 2025CompLLM: Compression for Long Context Q&Acited by 5
- 2026ReasonAlloc: Hierarchical Decoding-Time KV Cache Budget Allocation for Reasoning Modelscited by 3
- 2026AdaPLD: Adaptive Retrieval and Reuse for Efficient Model-Free Speculative Decodingcited by 1
- 2026Learning Evidence Highlighting for Frozen LLMscited by 0
- 2026Mechanistic Attention Guidance for Agent Memory Refinementcited by 0
- 2026Compression Beyond the Uncompressed: A Two-Stage Training Recipe for Soft Context Compression in RAGcited by 0
- 2026Protocol-Preserving Context Trimming for Agentic Workflows: Benefits, Failure Regimes, and Budget Guardrailscited by 0
- 2026Protocol-Preserving Context Trimming for Agentic Workflows: Benefits, Failure Regimes, and Budget Guardrails15 Sep 2026
- 2026Compression Beyond the Uncompressed: A Two-Stage Training Recipe for Soft Context Compression in RAG4 Sep 2026
- 2026Mechanistic Attention Guidance for Agent Memory Refinement20 Jul 2026
- 2026ReasonAlloc: Hierarchical Decoding-Time KV Cache Budget Allocation for Reasoning Models9 Jun 2026
- 2026AdaPLD: Adaptive Retrieval and Reuse for Efficient Model-Free Speculative Decoding4 Jun 2026
- 2026Learning Evidence Highlighting for Frozen LLMs24 Apr 2026
- 2026DeltaEvolve: Accelerating Scientific Discovery through Momentum-Driven Evolution2 Feb 2026
- 2026Gated Differentiable Working Memory for Long-Context Language Modeling19 Jan 2026
- 2025SemShareKV: Efficient KVCache Sharing for Semantically Similar Prompts via Token-Level LSH Matching29 Sep 2025
- 2025CompLLM: Compression for Long Context Q&A23 Sep 2025
Similar, not cited
Close in wording, no citation either way
- 2025Better Prompt Compression Without Multi-Layer Perceptrons
- 2026Prompt Compression in the Wild: Measuring Latency, Rate Adherence, and Quality for Faster LLM Inference
- 2026End-to-End Context Compression at Scale
- 2025Dynamic Compressing Prompts for Efficient Inference of Large Language Models
- 2024Prompt Compression for Large Language Models: A Survey
- 2026Compressing Long Context into Answer-Aligned Memory Embeddings for LLM Inference
- 2025Compress, Gather, and Recompute: REFORMing Long-Context Processing in Transformers
- 2025Lossless Token Sequence Compression via Meta-Tokens