arxiv
PublishedJuly 24, 2026 at 4:00 AM
Error Certificates for KV-Cache Eviction via Randomized Design
Publisher summary· verbatim
arXiv:2607.21475v1 Announce Type: cross Abstract: Deterministic KV-cache eviction keeps the top-$k$ tokens under an importance score and deletes the rest. We prove that this design cannot know what it destroyed: evicted values can be altered so that everything the serving system retains is unchanged
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivStochastic Sampling is Epistemically Shallow: The Dimensionality Gap Between Temperature Variation and Model Diversity in LLMs9harxivDecodeShare: Tracing the Shared Subspace of LLM Decode-Time Decisions9harxivPlanE: Meta Planning of Data, Tuning, and Inference for Extractive-based LLMs9harxivIncomplete Prompt Jailbreaks in Large Language Models9hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗