mlsanityData to 14 Oct 2026

DEL: Context-Aware Dynamic Exit Layer for Efficient Self-Speculative Decoding

arXiv 2504.05598 ↗First posted 8 Apr 2025cs.CL cs.LGcited by 8

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

Abstract (arXiv)

Speculative Decoding (SD) is a widely used approach to accelerate the inference of large language models (LLMs) without reducing generation quality. It operates by first using a compact model to draft multiple tokens efficiently, followed by parallel verification using the target LLM. This approach leads to faster inference compared to auto-regressive decoding. While there are multiple approaches to create a draft model, one promising approach is to use early-exit methods. These methods draft candidate tokens by using a subset of layers of the primary model and applying the remaining layers for verification, allowing a single model to handle both drafting and verification. While this technique reduces memory usage and computational cost, its performance relies on the choice of the exit layer for drafting and the number of tokens drafted (speculation length) in each SD round. Prior works use hyperparameter exploration to statically select these values. However, our evaluations show that these hyperparameter values are task-specific, and even within a task they are dependent on the current sequence context. We introduce DEL (Dynamic Exit Layer), a plug-and-play method that adaptively selects the exit layer and speculation length during inference. DEL dynamically tracks the token acceptance rate if the tokens are drafted at each layer of an LLM and uses that knowledge to heuristically select the optimal exit layer and speculation length. Our experiments across a broad range of models and downstream tasks show that DEL achieves overall speedups of 2.16×~2.62× over vanilla auto-regressive decoding and improves upon state-of-the-art SD methods, which peak at 2.43×, by up to 0.19×. The code is available at https://github.com/hoenza/DEL.

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

Builds on

22 of 29 references.

Closest ancestors · 13

Same direction, newest first

  1. 2025Training Domain Draft Models for Speculative Decoding: Best Practices and Insights10 Mar
  2. 2024AdaEDL: Early Draft Stopping for Speculative Decoding of Large Language Models via an Entropy-based Lower Bound on Token Acceptance Probability24 Oct
  3. 2024SWIFT: On-the-Fly Self-Speculative Decoding for LLM Inference Acceleration9 Oct
  4. 2024Draft on the Fly: Adaptive Self-Speculative Decoding using Cosine Similarity1 Oct
  5. 2024S3D: A Simple and Cost-Effective Self-Speculative Decoding Scheme for Low-Memory GPUs30 May
  6. 2024SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths30 May
  7. 2024Kangaroo: Lossless Self-Speculative Decoding via Double Early Exiting29 Apr
  8. 2024Direct Alignment of Draft Model for Speculative Decoding with Chat-Fine-Tuned LLMs29 Feb
  9. 2024GliDe with a CaPE: A Low-Hassle Method to Accelerate Speculative Decoding3 Feb
  10. 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding15 Jan
  11. 2023Online Speculative Decoding11 Oct
  12. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
1 more
  1. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 9

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  3. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  4. 2022Constitutional AI: Harmlessness from AI Feedbackcited by 3,050
  5. 2018Don't Give Me the Details, Just the Summary! Topic-Aware Convolutional Neural Networks for Extreme Summarizationcited by 1,317
  6. 2016Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyondcited by 812
  7. 2017Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problemscited by 650
  8. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 307
  9. 2018ROUGE 2.0: Updated and Improved Measures for Evaluation of Summarization Taskscited by 67

Built on by

Cited by year (2026 to 14 Oct)

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

8 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026SPEED-Bench: A Unified and Diverse Benchmark for Speculative Decoding
  2. 2025KNN-SSD: Enabling Dynamic Self-Speculative Decoding via Nearest Neighbor Layer Set Optimization
  3. 2025CLaSp: In-Context Layer Skip for Self-Speculative Decoding
  4. 2025Speculative Decoding: Performance or Illusion?
  5. 2026A Sparse Glimpse of the Whole: Train-Free Self-Speculative Decoding
  6. 2024Closer Look at Efficient Inference Methods: A Survey of Speculative Decoding
  7. 2025AdaSD: Adaptive Speculative Decoding for Efficient Language Model Inference
  8. 2025Scaling Up, Speeding Up: A Benchmark of Speculative Decoding for Efficient LLM Test-Time Scaling