mlsanityData to 7 Oct 2026

SDSAT: Accelerating LLM Inference through Speculative Decoding with Semantic Adaptive Tokens

arXiv 2403.18647 ↗First posted 27 Mar 2024cs.CLcited by 2

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

Abstract (arXiv)

We propose an acceleration scheme for large language models (LLMs) through Speculative Decoding with Semantic Adaptive Tokens (SDSAT). The primary objective of this design is to enhance the LLM model's ability to generate draft tokens more accurately without compromising the model's accuracy. The core strategies involve: 1) Fine-tune the model by incorporating semantic adaptive tokens that possess flexible decoding capabilities without changing its structure, allowing them to generate high-quality draft tokens. 2) By employing a training method that does not affect the standard tokens, the model can acquire parallel decoding abilities atop its original framework with minimal training overhead. 3) We have designed the "two-step-draft-then-verify" generation strategies using both greedy search and nucleus sampling. Experiments conducted on the CodeLlama-13B and 7B models have yielded speed increases of over 3.5X and 3.0X, respectively. Please refer to https://github.com/hasuoshenyun/SDSAT.

Key facts. Cited by 2 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 15 of its 20 references that are in the map. First posted on arXiv 27 Mar 2024.

Builds on

15 of 20 references.

Closest ancestors · 8

Same direction, newest first

  1. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  2. 2023REST: Retrieval-Based Speculative Decoding14 Nov
  3. 2023DistillSpec: Improving Speculative Decoding via Knowledge Distillation12 Oct
  4. 2023Accelerating LLM Inference with Staged Speculative Decoding8 Aug
  5. 2023Accelerating Transformer Inference for Translation via Parallel Decoding17 May
  6. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  7. 2022Fast Inference from Transformers via Speculative Decoding30 Nov
  8. 2022Speculative Decoding: Exploiting Speculative Execution for Accelerating Seq2seq Generation30 Mar

Other references · 7

  1. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  2. 2021Program Synthesis with Large Language Modelscited by 3,509
  3. 2019The Curious Case of Neural Text Degenerationcited by 2,881
  4. 2023Code Llama: Open Foundation Models for Codecited by 2,105
  5. 2018Blockwise Parallel Decoding for Deep Autoregressive Modelscited by 318
  6. 2023SantaCoder: don't reach for the stars!cited by 169
  7. 2022MultiPL-E: A Scalable and Extensible Approach to Benchmarking Neural Code Generationcited by 132

Built on by

Cited by year (2026 to 7 Oct)

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

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025AdaSD: Adaptive Speculative Decoding for Efficient Language Model Inference
  2. 2025Tutorial Proposal: Speculative Decoding for Efficient LLM Inference
  3. 2025Accelerating LLM Inference with Lossless Speculative Decoding Algorithms for Heterogeneous Vocabularies
  4. 2024Recursive Speculative Decoding: Accelerating LLM Inference via Sampling Without Replacement
  5. 2026Faster LLM Inference via Sequential Monte Carlo
  6. 2024Closer Look at Efficient Inference Methods: A Survey of Speculative Decoding
  7. 2025Speculative Decoding: Performance or Illusion?
  8. 2025AdaDecode: Accelerating LLM Decoding with Adaptive Layer Parallelism