KV Cache Offloading for Context-Intensive Tasks

arXiv cs.CL / 4/10/2026

💬 OpinionSignals & Early TrendsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper studies KV-cache offloading for long-context LLMs specifically on context-intensive tasks, where accurate solutions require extensive information retrieval from the input prompt.
  • It introduces and releases the Text2JSON benchmark to measure structured knowledge extraction from raw text under high context demands.
  • Experiments on Llama 3 and Qwen 3 show that existing KV offloading methods cause significant accuracy degradation on these context-intensive benchmarks.
  • The authors attribute the failures to factors including low-rank projection of keys and unreliable “landmarks,” and they propose a simpler alternative strategy that improves accuracy across multiple LLM families and benchmarks.
  • The work concludes that long-context compression/offloading techniques require more rigorous, task-relevant evaluation beyond prior benchmarks that were not highly context-intensive.

Abstract

With the growing demand for long-context LLMs across a wide range of applications, the key-value (KV) cache has become a critical bottleneck for both latency and memory usage. Recently, KV-cache offloading has emerged as a promising approach to reduce memory footprint and inference latency while preserving accuracy. Prior evaluations have largely focused on tasks that do not require extracting large amounts of information from the context. In this work, we study KV-cache offloading on context-intensive tasks: problems where the solution requires looking up a lot of information from the input prompt. We create and release the Text2JSON benchmark, a highly context-intensive task that requires extracting structured knowledge from raw text. We evaluate modern KV offloading on Text2JSON and other context-intensive tasks and find significant performance degradation on both Llama 3 and Qwen 3 models. Our analysis identifies two key reasons for poor accuracy: low-rank projection of keys and unreliable landmarks, and proposes a simpler alternative strategy that significantly improves accuracy across multiple LLM families and benchmarks. These findings highlight the need for a comprehensive and rigorous evaluation of long-context compression techniques.