Sign inGet started
Paper · arXiv

DeferKV: Rethinking Eviction Timing for One-Shot KV Cache Compression

Long-context large language models (LLMs) have demonstrated strong capabilities across a wide range of tasks, but the growing KV cache introduces substantial memory and inference overhead. Existing one-shot KV cache compression methods typically commit to irreversible eviction immediately after prefill, before any signal from actual generation becomes available. Our quantitative analysis shows that early queries from the actual generation stage provide attention signals that are more consistent with subsequent decode attention, with the largest single-step gain occurring at the prefill-decode boundary. Based on this observation, we propose DeferKV, which moves the eviction decision from t...

AuthorsZhe Wang, Jiakai Li, Yujia Sun et al.
Primary categorycs.CL
Published5 October 2026
Last updated at source5 October 2026
cs.CL
Embed this entry
<iframe src="https://silytics.si/embed/item/bb4fb783-2d60-41db-85b0-252e356ce654" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.