Skip to main navigation Skip to search Skip to main content

WindowKV: Task-adaptive group-wise KV cache window selection for efficient LLM inference

  • Youhui Zuo
  • , Sibo Wei
  • , Chen Zhang
  • , Zhuorui Liu
  • , Wenpeng Lu
  • , Dawei Song*
  • *Corresponding author for this work
  • Beijing Institute of Technology
  • Qilu University of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

With the advancements in long-context inference capabilities of large language models (LLMs), the KV cache has become one of the foundational components. While recent studies have focused on optimizing the memory occupied by the KV cache, they overlook two critical factors: preserving semantic coherence and considering task-specific characteristic during compression. To address these limitations, we propose a novel task-adaptive KV cache window selection method, WindowKV. WindowKV dynamically selects local semantic windows consisting of consecutive tokens, according to task-specific characteristics, ensuring the retained KV cache captures continuous, essential context. Additionally, we introduce an intra-group layer KV cache indices sharing strategy to reduce computational overhead, achieving a balance between performance and efficiency. We rigorously evaluate WindowKV on the LongBench benchmark, and the results demonstrate that it maintains a performance comparable to full KV cache retention while using only 12% of the original KV cache, significantly reducing memory requirements. Furthermore, our method also achieves state-of-the-art results in the Needle-in-a-Haystack evaluation, highlighting its effectiveness and robustness. (Our code is available at GitHub).

Original languageEnglish
Article number134291
JournalExpert Systems with Applications
Volume333
DOIs
Publication statusPublished - 15 Jan 2027

Keywords

  • Inference efficiency
  • KV cache compression
  • Large language model

Fingerprint

Dive into the research topics of 'WindowKV: Task-adaptive group-wise KV cache window selection for efficient LLM inference'. Together they form a unique fingerprint.

Cite this