FirsthandTech
arXiv — cs.AI preprintsInternational7 October 2026

ValueDiff: Value-Geometric KV Cache Eviction for Sink-Suppressed LLMs

This is an official announcement record

Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.

arXiv:2609.23314v2 Announce Type: replace-cross Abstract: Modern LLMs with QK-normalization, gated attention, learned attention sinks, or logit softcapping exhibit weaker persistent attention sinks, on which existing KV cache eviction methods primarily rely. We observe that across these models, weaker sinks co-occur with greater value-vector dispersion relative to key-vector dispersion. Motivated by this value-side dispersion, we present ValueDiff, a value-geometric eviction that ranks tokens by the L2 deviation of their value vectors from the cache mean. The same score arises as the minimal-d
— arXiv — cs.AI preprints

More from arXiv — cs.AI preprints

This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.