mlsanityData to 7 Oct 2026

Lossless Acceleration of Large Language Models with Hierarchical Drafting based on Temporal Locality in Speculative Decoding

arXiv 2502.05609 ↗First posted 8 Feb 2025cs.CLcited by 4

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

Abstract (arXiv)

Accelerating inference in Large Language Models (LLMs) is critical for real-time interactions, as they have been widely incorporated into real-world services. Speculative decoding, a fully algorithmic solution, has gained attention for improving inference speed by drafting and verifying tokens, thereby generating multiple tokens in a single forward pass. However, current drafting strategies usually require significant fine-tuning or have inconsistent performance across tasks. To address these challenges, we propose Hierarchy Drafting (HD), a novel lossless drafting approach that organizes various token sources into multiple databases in a hierarchical framework based on temporal locality. In the drafting step, HD sequentially accesses multiple databases to obtain draft tokens from the highest to the lowest locality, ensuring consistent acceleration across diverse tasks and minimizing drafting latency. Our experiments on Spec-Bench using LLMs with 7B and 13B parameters demonstrate that HD outperforms existing database drafting methods, achieving robust inference speedups across model sizes, tasks, and temperatures.

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 28 of its 43 references that are in the map. First posted on arXiv 8 Feb 2025.

Builds on

28 of 43 references.

Closest ancestors · 12

Same direction, newest first

  1. 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
  2. 2024Towards Fast Multilingual LLM Inference: Speculative Decoding and Specialized Drafters24 Jun
  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. 2023REST: Retrieval-Based Speculative Decoding14 Nov
  8. 2023Accelerating LLM Inference with Staged Speculative Decoding8 Aug
  9. 2023Accelerating Transformer Inference for Translation via Parallel Decoding17 May
  10. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  11. 2022Fast Inference from Transformers via Speculative Decoding30 Nov
  12. 2022Speculative Decoding: Exploiting Speculative Execution for Accelerating Seq2seq Generation30 Mar

Other references · 16

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  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. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  5. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
  6. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  7. 2023Enhancing Chat Language Models by Scaling High-quality Instructional Conversationscited by 825
  8. 2016Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyondcited by 809
  9. 2023OpenAssistant Conversations -- Democratizing Large Language Model Alignmentcited by 712
  10. 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 700
  11. 2024TinyLlama: An Open-Source Small Language Modelcited by 604
  12. 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 517
4 more
  1. 2022The Stack: 3 TB of permissively licensed source codecited by 354
  2. 2018Blockwise Parallel Decoding for Deep Autoregressive Modelscited by 318
  3. 2024Turning Trash into Treasure: Accelerating Inference of Large Language Models with Token Recyclingcited by 48
  4. 2024Optimising Calls to Large Language Models with Uncertainty-Based Two-Tier Selectioncited by 32

Built on by

Cited by year (2026 to 7 Oct)

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

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Fast Inference via Hierarchical Speculative Decoding
  2. 2025Hierarchical Verification of Speculative Beams for Accelerating LLM Inference
  3. 2023Draft & Verify: Lossless Large Language Model Acceleration via Self-Speculative Decoding
  4. 2024Recursive Speculative Decoding: Accelerating LLM Inference via Sampling Without Replacement
  5. 2024Decoding Speculative Decoding
  6. 2025READER: Retrieval-Assisted Drafter for Efficient LLM Inference
  7. 2024Minions: Accelerating Large Language Model Inference with Aggregated Speculative Execution
  8. 2025PipeSpec: Breaking Stage Dependencies in Hierarchical LLM Decoding