mlsanityData to 7 Oct 2026

HiSpec: Hierarchical Speculative Decoding for LLMs

arXiv 2510.01336 ↗First posted 1 Oct 2025cs.CL cs.AI cs.LGcited by 3

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

Abstract (arXiv)

Speculative decoding accelerates LLM inference by using a smaller draft model to speculate tokens that a larger target model verifies. Verification is often the bottleneck (e.g. verification is 4× slower than token generation when a 3B model speculates for a 70B target model), but most prior works focus only on accelerating drafting. textit``Intermediate" verification reduces verification time by discarding inaccurate draft tokens early, but existing methods incur substantial training overheads in incorporating the intermediate verifier, increase the memory footprint to orchestrate the intermediate verification step, and compromise accuracy by relying on approximate heuristics. We propose underlinetextitHitextiterarchical underlinetextitSpectextitulative Decoding (HiSpec), a framework for high-throughput speculative decoding that exploits textitearly-exit (EE) models for low-overhead intermediate verification. EE models allow tokens to exit early by skipping layer traversal and are explicitly trained so that hidden states at selected layers can be interpreted, making them uniquely suited for intermediate verification without drastically increasing compute and memory overheads. To improve resource-efficiency even further, we design a methodology that enables HiSpec to re-use key-value caches and hidden states between the draft, intermediate verifier, and target models. To maintain accuracy, HiSpec periodically validates the draft tokens accepted by the intermediate verifier against the target model. Our evaluations using various representative benchmarks and models show that HiSpec improves throughput by 1.28× on average and by up to 2.01× compared to the baseline single-layer speculation without compromising accuracy.

Key facts. Cited by 3 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 22 of its 33 references that are in the map. First posted on arXiv 1 Oct 2025.

Builds on

22 of 33 references.

Closest ancestors · 9

Same direction, newest first

  1. 2025Efficient Speculative Decoding for Llama at Scale: Challenges and Solutions11 Aug
  2. 2025AdaDecode: Accelerating LLM Decoding with Adaptive Layer Parallelism4 Jun
  3. 2024SWIFT: On-the-Fly Self-Speculative Decoding for LLM Inference Acceleration9 Oct
  4. 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decoding3 Feb
  5. 2024Decoding Speculative Decoding2 Feb
  6. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  7. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
  8. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  9. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 13

  1. 2024The Llama 3 Herd of Modelscited by 14,192
  2. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  3. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  4. 2025Qwen3 Technical Reportcited by 8,195
  5. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  6. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
  7. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
  8. 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,346
  9. 2023Code Llama: Open Foundation Models for Codecited by 2,105
  10. 2018Don't Give Me the Details, Just the Summary! Topic-Aware Convolutional Neural Networks for Extreme Summarizationcited by 1,308
  11. 2016Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyondcited by 809
  12. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 302
1 more
  1. 2025Draft-based Approximate Inference for LLMscited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 2.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025PipeSpec: Breaking Stage Dependencies in Hierarchical LLM Decoding
  2. 2026Faster LLM Inference via Sequential Monte Carlo
  3. 2025Speculative Verification: Exploiting Information Gain to Refine Speculative Decoding
  4. 2025Think Before You Accept: Semantic Reflective Verification for Faster Speculative Decoding
  5. 2025Tutorial Proposal: Speculative Decoding for Efficient LLM Inference
  6. 2026Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decoding
  7. 2026Test-Time Speculation
  8. 2025Mirror Speculative Decoding: Breaking the Serial Barrier in LLM Inference