TaskPress: Query-Agnostic KV Cache Compression via Task-Guided Pruning
On the map: Efficient LLM inference and serving → KV cache optimization
Abstract (arXiv)
Long-context inference with large language models is constrained by the linear growth of the key-value cache to sequence length. While pruning offers mitigation, prevailing methods determine query-specific token importance that cannot be reused across unseen queries. In contrast, we introduce TaskPress, a framework for task-guided, query-agnostic KV cache eviction. Instead of optimizing the cache for a single query, TaskPress constructs a reusable memory representation conditioned on a high-level task guide. The guide functions as a meta-query during prefill to filter irrelevant tokens before downstream queries are issued. In addition, TaskPress leverages quantization scale factors as a zero-cost signal for detecting influential representation outliers, providing an efficient proxy for token importance. Experiments on conducted on various tasks with long context input demonstrate that TaskPress efficiently creates a compact, reusable cache across diverse queries.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in KV cache optimization, one of 12 directions in Efficient LLM inference and serving. Builds on 15 of its 19 references that are in the map. First posted on arXiv 4 Aug 2026.
Builds on
15 of 19 references.
Closest ancestors · 6
Same direction, newest first
- 2025Expected Attention: KV Cache Compression by Estimating Attention from Future Queries Distribution1 Oct
- 2025KVzip: Query-Agnostic KV Cache Compression with Context Reconstruction29 May
- 2024ThinK: Thinner Key Cache by Query-Driven Pruning30 Jul
- 2024Attention Score is not All You Need for Token Importance Indicator in KV Cache Reduction: Value Also Matters18 Jun
- 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inference16 Jun
- 2024SnapKV: LLM Knows What You are Looking for Before Generation22 Apr
Other references · 9
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
- 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,417
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,346
- 2024KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cachecited by 637
- 2017The NarrativeQA Reading Comprehension Challengecited by 597
- 2024SpinQuant: LLM quantization with learned rotationscited by 471
- 2021QMSum: A New Benchmark for Query-based Multi-domain Meeting Summarizationcited by 365
- 2025Value-Guided KV Compression for LLMs via Approximated CUR Decompositioncited by 7
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026EchoPress: Query-Agnostic KV Cache Pruning via Virtual Context Reconstruction
- 2026KV2: A Self-Refining KV Cache
- 2026Where Matters More Than What: Decoding-aligned KV Cache Compression via Position-aware Pseudo Queries
- 2024RazorAttention: Efficient KV Cache Compression Through Retrieval Heads
- 2025Compactor: Calibrated Query-Agnostic KV Cache Compression with Approximate Leverage Scores
- 2025CompressKV: Semantic Retrieval Heads Know What Tokens are Not Important Before Generation
- 2026Make Each Token Count: Towards Improving Long-Context Performance with KV Cache Eviction
- 2024More Tokens, Lower Precision: Towards the Optimal Token-Precision Trade-off in KV Cache Compression