Sep 2026· Workshop Proceedings of the 55th International Conference on Parallel Processing· pp. 108-109· 0 citations· 2 references
TL;DR
Results show that repeated tokens expose context-conditioned, slice-local similarity in Transformer cache traces, providing an empirical foundation for future repeated-token-aware KV-cache optimization and clarifying representation constraints for such optimizations.
Abstract
Long-context inference in decoder-only transformers is increasingly limited by key–value (KV) cache memory. This work investigates a complementary empirical question: when the same token ID recurs, do its hidden-state and KV traces exhibit coherent structure with low-dimensional variation? We present a repeated-token diagnostic study of Transformer cache traces. We collect hidden-state, pre-RoPE key, and value traces, and compare token-only, token+local-context, and token+position grouping within fixed layer–head slices. On LongBench-v1 traces from Qwen2.5-7B-Instruct and Mistral-7B-Instruct-v0.3, duplicate token IDs account for 96.2–97.8% of hidden-state occurrences. Local-context buckets raise hidden-state centroid cosine to 0.90–0.94, and token+local-context groups have stable rank near 2 and top-4 spectral energy near 0.89–0.95 across hidden, pre-RoPE key, and value traces. These results show that repeated tokens expose context-conditioned, slice-local similarity in Transformer cache traces, providing an empirical foundation for future repeated-token-aware KV-cache optimization and clarifying representation constraints for such optimizations.
This work derives a sufficient suffix schedule that reduces upper-layer construction work while preserving the complete cache in exact arithmetic, and derives a sufficient suffix schedule that reduces upper-layer construction work while preserving the complete cache in exact arithmetic.
This work proposes DistillCache, a reinforcement learning framework that formulates KV-cache eviction as a sequential decision problem and demonstrates the effectiveness of learned, distribution-aware policies for memory-efficient long-context LLM inference.
This model reveals one key opportunity: dividing a restore request proportionally between the storage path and the GPU can improve inference performance while still meeting SLOs, and reduces the KV-cache storage stack to a performance model based on per-tier capacity, per-tier and interconnect bandwidth, and GPU arithm...
Long-output reasoning shifts the KV-cache bottleneck from the fixed prompt to the generated trace. Existing reasoning-cache eviction methods largely treat cached entries as routing objects, estimating whether an old key will still be read, will recur, or can be replaced. This routing-only view overlooks two effects: lo...
Han Yu, Wen-Hui Zhu, Xi-Wen Chen et al.· 0 citations
TwinKV, a training-free method that discounts value energy by nonlocal post-RoPE key frequency, is introduced, showing that modest frequency corrections can change retention and answering outcomes, with effects that depend on the model and task.
Hong Chen, Yuan Zeng, Yong-Wei Huang et al.· 0 citations
KV-cache eviction can do more than compress. In long-context LLMs, keeping only some cached tokens sometimes matches or exceeds full-cache accuracy, because many redundant prefill tokens otherwise dilute attention away from the tokens that carry the answer. This benefit is not uniform, and evicting the wrong tokens can...
Pankaj Kumar, Subhankar Mishra· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.