mlsanityData to 7 Oct 2026

When Hidden States Drift: Can KV Caches Rescue Long-Range Speculative Decoding?

arXiv 2604.26412 ↗First posted 29 Apr 2026cs.CLcited by 4

On the map: Efficient LLM inference and serving → Speculative decoding

Abstract (arXiv)

Speculative decoding accelerates LLM inference, but SOTA hidden-state-based drafters suffer from long-range decay: draft accuracy degrades as the speculative step increases. Existing work attributes this decay to train-inference mismatch and proposes test-time training (TTT) as a remedy, yet we observe that long-range decay persists even in TTT-trained drafters. We revisit long-range decay from the perspective of context information preservation. In hidden-state reuse, we argue the target hidden state acts as a biased context compression: it aggregates historical token information according to the attention query at the current position, yielding a compact representation optimized for immediate next-token prediction. This compression can suppress information less relevant to the current query but important for later speculative steps. In contrast, the target model's KV cache serves as an explicit context, retaining the complete set of token-wise KV representations. We therefore posit the KV-Reuse Hypothesis: allowing the draft model to reuse the target KV cache can provide richer signals for long-horizon drafting. To test this hypothesis, we introduce KVShot, a diagnostic framework that compares three reuse paradigms: hidden-only, KV-only, and hybrid. Extensive evaluations on Qwen3-8B show that KV-Reuse improves long-range acceptance, although end-to-end speedups remain marginal under current training pipelines. Our analysis identifies two key structural bottlenecks: shallow drafters struggle to estimate target queries accurately, and draft-side KV projections receive sparse gradient signals. These findings suggest that realizing the full potential of KV-aware decoding requires moving beyond TTT toward block-wise training paradigms. By exposing these bottlenecks, KVShot provides a foundational diagnostic testbed and a clear roadmap for designing next-generation inference architectures.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 23 of its 29 references that are in the map. First posted on arXiv 29 Apr 2026.

Builds on

23 of 29 references.

Closest ancestors · 21

Same direction, newest first

  1. 2026DFlash: Block Diffusion for Flash Speculative Decoding5 Feb
  2. 2026TALON: Confidence-Aware Speculative Decoding with Adaptive Token Trees12 Jan
  3. 2026Double: Breaking the Acceleration Limit via Double Retrieval Speculative Parallelism9 Jan
  4. 2025LogitSpec: Accelerating Retrieval-based Speculative Decoding via Next Next Token Speculation2 Jul
  5. 2025KNN-SSD: Enabling Dynamic Self-Speculative Decoding via Nearest Neighbor Layer Set Optimization22 May
  6. 2025SpecBranch: Speculative Decoding via Hybrid Drafting and Rollback-Aware Branch Parallelism16 May
  7. 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
  8. 2025LongSpec: Long-Context Lossless Speculative Decoding with Efficient Drafting and Verification24 Feb
  9. 2024SWIFT: On-the-Fly Self-Speculative Decoding for LLM Inference Acceleration9 Oct
  10. 2024Learning Harmonized Representations for Speculative Sampling28 Aug
  11. 2024PEARL: Parallel Speculative Decoding with Adaptive Draft Length13 Aug
  12. 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
9 more
  1. 2024Sequoia: Scalable, Robust, and Hardware-aware Speculative Decoding19 Feb
  2. 2024GliDe with a CaPE: A Low-Hassle Method to Accelerate Speculative Decoding3 Feb
  3. 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decoding3 Feb
  4. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  5. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
  6. 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding15 Jan
  7. 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification16 May
  8. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  9. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 2

  1. 2024Better & Faster Large Language Models via Multi-token Predictioncited by 344
  2. 2026HIPPO: Accelerating Video Large Language Models Inference via Holistic-aware Parallel Speculative Decodingcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 4.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Make Every Draft Count: Hidden State based Speculative Decoding
  2. 2026Carryover Drafting: Recycling Rejected States for Speculative Decoding
  3. 2026Attention Drift: What Autoregressive Speculative Decoding Models Learn
  4. 2026Strong Drafts Need Compact Memories: Long-Context Speculative Decoding with Compressed KV Cache
  5. 2026A Sparse Glimpse of the Whole: Train-Free Self-Speculative Decoding
  6. 2026Lynx: Progressive Speculative Quantization for accelerating KV Transfer in Long-Context Inference
  7. 2026DualDecoder: Accelerate Long Context LLM Inference by Predictive Prefetch
  8. 2026LongSpark: Efficient speculative decoding with a fixed-cost parallel drafter