Training-free Dropout Sampling for Semantic Token Acceptance in Speculative Decoding
On the map: Efficient LLM inference and serving → Speculative decoding
Abstract (arXiv)
Speculative decoding accelerates large language model inference by proposing tokens with a lightweight draft model and selectively accepting them using a target model. This work introduces DropMatch, a novel approach that matches draft tokens to the predictive distribution of the target model via Monte Carlo dropout applied exclusively to the LM head, enabling sampling-based acceptance decisions. By generating multiple decoding paths, our method forms an empirical token distribution against which draft tokens are evaluated for consistency. This acceptance mechanism enables the model to adaptively control the size of decoding paths under an appropriate dropout probability, preventing substantial distortion of the target model predictive distribution. The proposed method operates in a training-free, data-free, and calibration-free manner, requires no architectural modification to pretrained models, and can be orthogonally integrated with a wide range of existing speculative decoding and inference acceleration techniques. Experiments across multiple benchmarks demonstrate that our approach increases acceptance length while maintaining competitive task performance, yielding inference speedups ranging from 1.09x to 1.33x over the standard baseline, and up to an additional 1.09x speedup when applied on top of EAGLE3.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 29 of its 39 references that are in the map. First posted on arXiv 11 Feb 2026.
Builds on
29 of 39 references.
Closest ancestors · 11
Same direction, newest first
- 2025SelfJudge: Faster Speculative Decoding via Self-Supervised Judge Verification26 Sep
- 2025AutoJudge: Judge Decoding Without Manual Annotation28 Apr
- 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
- 2025Judge Decoding: Faster Speculative Sampling Requires Going Beyond Model Alignment31 Jan
- 2024Learning Harmonized Representations for Speculative Sampling28 Aug
- 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
- 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding15 Jan
- 2023DistillSpec: Improving Speculative Decoding via Knowledge Distillation12 Oct
- 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
- 2022Fast Inference from Transformers via Speculative Decoding30 Nov
- 2022Speculative Decoding: Exploiting Speculative Execution for Accelerating Seq2seq Generation30 Mar
Other references · 18
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2025Qwen3 Technical Reportcited by 8,195
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2019The Curious Case of Neural Text Degenerationcited by 2,881
- 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,157
6 more
- 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 1,906
- 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,332
- 2023Instruction-Following Evaluation for Large Language Modelscited by 1,143
- 2023Semantic Uncertainty: Linguistic Invariances for Uncertainty Estimation in Natural Language Generationcited by 795
- 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 700
- 2025Who's Your Judge? On the Detectability of LLM-Generated Judgmentscited by 6
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Acceptance-Aware Draft Model Training for Speculative Decoding
- 2026LK Losses: Direct Acceptance Rate Optimization for Speculative Decoding
- 2025Out-of-Vocabulary Sampling Boosts Speculative Decoding
- 2025Training-Free Loosely Speculative Decoding: Accepting Semantically Correct Drafts Beyond Exact Match
- 2024Speculative Decoding via Early-exiting for Faster LLM Inference with Thompson Sampling Control Mechanism
- 2026Faster LLM Inference via Sequential Monte Carlo
- 2026D^2SD: Accelerating Speculative Decoding with Dual Diffusion Draft Models
- 2024AdaEDL: Early Draft Stopping for Speculative Decoding of Large Language Models via an Entropy-based Lower Bound on Token Acceptance Probability