mlsanityData to 14 Oct 2026

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

arXiv 2605.18825 ↗First posted 12 May 2026cs.LG cs.DCcited by 3

Not on the map. Why?

Abstract (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 benefit depends critically on the eviction policy as GPU memory is scarce, and existing policies such as LRU largely treat cached blocks uniformly. This view ignores a fundamental property of LLM prompts: not all tokens are equally worth caching. We show that different token types within a prompt, including system prompts, user queries, tool outputs, model responses, and chain-of-thought reasoning, exhibit up to 756x variation in reuse rates, yet no existing eviction policy exploits this signal. In this paper, we present SAECache (Semantic-Adaptive Eviction for prefix caches), a semantic-adaptive prefix cache eviction policy that addresses this gap through three innovations: (1) a multi-queue architecture that routes KV blocks to task-specific queues with tailored priority metrics, capturing both session reuse in multi-turn requests and structural reuse in templated single-turn requests; (2) a semantic-aware token weighting mechanism that learns the reuse value of different token types online through eviction feedback; and (3) a fully adaptive online learning schema for all parameter updates, including log-normal timing parameters, position decay power, queue weights, and meta-parameters, which eliminates manual tuning and enables automatic adaptation to deployment-specific workload characteristics. Through extensive evaluation across heterogeneous workloads, we demonstrate that SAECache achieves 1.4x-2.7x TTFT improvement over production-style baselines, while fixed-parameter alternatives can degrade by up to 2.7x under workload mismatch -- a failure mode our adaptive approach avoids entirely.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 8 of its 14 references that are in the map. First posted on arXiv 12 May 2026.

Builds on

8 of 14 references.

References · 8

  1. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
  2. 2024Cost-Efficient Large Language Model Serving for Multi-turn Conversations with CachedAttentioncited by 163
  3. 2024Preble: Efficient Distributed Prompt Scheduling for LLM Servingcited by 70
  4. 2025KVFlow: Efficient Prefix Caching for Accelerating LLM-Based Multi-Agent Workflowscited by 56
  5. 2025Continuum: Efficient and Robust Multi-Turn LLM Agent Scheduling with KV Cache Time-to-Livecited by 44
  6. 2024Marconi: Prefix Caching for the Era of Hybrid LLMscited by 31
  7. 2023Token Prediction as Implicit Classification to Identify LLM-Generated Textcited by 27
  8. 2025Jenga: Effective Memory Management for Serving LLM with Heterogeneitycited by 25

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025CAKE: Cascading and Adaptive KV Cache Eviction with Layer Preferences
  2. 2024NACL: A General and Effective KV Cache Eviction Framework for LLMs at Inference Time
  3. 2026Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching
  4. 2025CAOTE: KV Cache Selection for LLMs via Attention Output Error-Based Token Eviction
  5. 2026Sparse Prefix Caching for Hybrid and Recurrent LLM Serving
  6. 2026Reformulating KV Cache Eviction Problem for Long-Context LLM Inference
  7. 2026Make Each Token Count: Towards Improving Long-Context Performance with KV Cache Eviction
  8. 2026TokenPilot: Cache-Efficient Context Management for LLM Agents