paper-with-me

Papers

TaskPress: Query-Agnostic KV Cache Compression via Task-Guided Pruning

2026-08-04 · Wonpyo Park, Seung-won Hwang 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.

📄 PDF Abstract BibTeX arXiv:2608.03276

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

StreamMem: Query-Agnostic KV Cache Memory for Streaming Video Understanding

2025-08-21 · Yanlai Yang, Zhuokai Zhao, Satya Narayan Shukla, Aashu Singh 외 arxiv

Multimodal large language models (MLLMs) have made significant progress in visual-language reasoning, but their ability to efficiently handle long videos remains limited. Despite recent advances in long-context MLLMs, st…

Video Question Answering

Compactor: Calibrated Query-Agnostic KV Cache Compression with Approximate Leverage Scores

2025-07-10 · Vivek Chari, Benjamin Van Durme

Modern Large Language Models (LLMs) are increasingly trained to support very large context windows. Unfortunately the ability to use long contexts in generation is complicated by the large memory requirement of the KV ca…

Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching

2026-07-17 · Yan Song arxiv

Production LLM deployments combine two cost-reduction primitives: prompt caching (a discounted rate for re-used token prefixes) and prompt compression (fewer tokens sent). The compression literature has standardized on q…

KVzip: Query-Agnostic KV Cache Compression with Context Reconstruction

2025-05-29 · Jang-Hyun Kim, Jinuk Kim, Sangwoo Kwon, Jae W. Lee 외

Transformer-based large language models (LLMs) cache context as key-value (KV) pairs during inference. As context length grows, KV cache sizes expand, leading to substantial memory overhead and increased attention latenc…

Question Answering

InfiniPot-V: Memory-Constrained KV Cache Compression for Streaming Video Understanding

2025-06-18 · Minsoo Kim, Kyuhong Shim, Jungwook Choi, Simyung Chang

Modern multimodal large language models (MLLMs) can reason over hour-long video, yet their key-value (KV) cache grows linearly with time--quickly exceeding the fixed memory of phones, AR glasses, and edge robots. Prior c…

GPUStreaming video understandingTARVideo Understanding