paper-with-me

홈 › Papers

SABlock: Semantic-Aware KV Cache Eviction with Adaptive Compression Block Size

2025-10-26 · Jinhan Chen, Jianchun Liu, Hongli Xu, Xianjun Gao, Shilong Wang arxiv

The growing memory footprint of the Key-Value (KV) cache poses a severe scalability bottleneck for long-context Large Language Model (LLM) inference. While KV cache eviction has emerged as an effective solution by discarding less critical tokens, existing token-, block-, and sentence-level compression methods struggle to balance semantic coherence and memory efficiency. To this end, we introduce SABlock, a \underline{s}emantic-aware KV cache eviction framework with \underline{a}daptive \underline{block} sizes. Specifically, SABlock first performs semantic segmentation to align compression boundaries with linguistic structures, then applies segment-guided token scoring to refine token importance estimation. Finally, for each segment, a budget-driven search strategy adaptively determines the optimal block size that preserves semantic integrity while improving compression efficiency under a given cache budget. Extensive experiments on long-context benchmarks demonstrate that SABlock consistently outperforms state-of-the-art baselines under the same memory budgets. For instance, on Needle-in-a-Haystack (NIAH), SABlock achieves 99.9% retrieval accuracy with only 96 KV entries, nearly matching the performance of the full-cache baseline that retains up to 8K entries. Under a fixed cache budget of 1,024, SABlock further reduces peak memory usage by 46.28% and achieves up to 9.5x faster decoding on a 128K context length.

📄 PDF Abstract BibTeX arXiv:2510.22556

Code (0)

등록된 구현이 없습니다.

Tasks

Semantic Segmentation

Similar Papers 제목 키워드 기반

Not All Tokens Are Worth Caching: Learning Semantic-Aware Eviction for LLM Prefix Caches

2026-05-12 · Shaoke Fang, Ziang Li, Wenfei Wu, Jiatong Ji 외 arxiv

Prefix caching is a key optimization in Large Language Model (LLM) serving, reusing attention Key-Value (KV) states across requests with shared prompt prefixes to reduce expensive prefill computation. However, its benefi…

Ada-KV: Optimizing KV Cache Eviction by Adaptive Budget Allocation for Efficient LLM Inference

2024-07-16 · Yuan Feng, Junlin Lv, Yukun Cao, Xike Xie 외

Large Language Models have excelled in various domains but face efficiency challenges due to the growing Key-Value (KV) cache required for long-sequence inference. Recent efforts aim to reduce KV cache size by evicting v…

Value-Aware Stochastic KV Cache Eviction for Reasoning Models

2026-06-02 · Ting-Yun Chang, Harvey Yiyun Fu, Deqing Fu, Chenghao Yang 외 arxiv

Reasoning models improve accuracy through extended chains of thought, but their long outputs create a memory and compute bottleneck. KV cache eviction methods reduce this cost by evicting unimportant key-value pairs from…

MemDecay: Region-Aware KV Cache Eviction for Efficient LLM Agent Inference

2026-07-12 · Venkatesha Matam, Keon Kim arxiv

Large language model (LLM) agents accumulate heterogeneous context, including system instructions, plans, user turns, retrieved documents, tool outputs, and intermediate reasoning, whose key-value (KV) cache can become a…

MadaKV: Adaptive Modality-Perception KV Cache Eviction for Efficient Multimodal Long-Context Inference

2025-06-06 · Kunxi Li, Zhonghua Jiang, Zhouzhou Shen, Zhaode Wang 외

This paper introduces MadaKV, a modality-adaptive key-value (KV) cache eviction strategy designed to enhance the efficiency of multimodal large language models (MLLMs) in long-context inference. In multimodal scenarios, …