Training-Free Loosely Speculative Decoding: Accepting Semantically Correct Drafts Beyond Exact Match
On the map: Efficient LLM inference and serving → Speculative decoding
Abstract (arXiv)
Large language models (LLMs) achieve strong performance across diverse tasks but suffer from high inference latency due to their autoregressive generation. Speculative Decoding (SPD) mitigates this issue by verifying candidate tokens in parallel from a smaller draft model, yet its strict exact-match verification discards many semantically valid continuations. Moreover, existing training-based SPD methods often suffer from performance degradation on out-of-distribution (OOD) tasks. To this end, we propose Training-Free Loosely Speculative Decoding (FLy), a novel method that loosens the rigid verification criterion by leveraging the target model's self-corrective behavior to judge whether a draft-target mismatch remains semantically valid. FLy introduces a two-tier mechanism: an entropy-level gate that identifies whether the current token allows multiple plausible alternatives or is nearly deterministic, and a token-level deferred window that distinguishes genuine errors from differently worded yet semantically correct variants. To further reduce latency, we design a multi-level acceleration strategy that accelerates not only the target model but also the drafter itself. Owing to its training-free design, FLy composes seamlessly with arbitrary draft-target pairs and generalizes across models and domains without hyperparameter re-tuning. Experiments show that FLy preserves more than 99% of the target model's accuracy while achieving an average 2.81x speedup on Llama-3.1-70B-Instruct and 5.07x speedup on the 405B variant. Notably, on out-of-domain datasets, our method remains highly effective and outperforms the training-based method EAGLE-3 by 1.62x.
Key facts. Cited by 11 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 35 of its 41 references that are in the map. First posted on arXiv 28 Nov 2025.
Builds on
35 of 41 references.
Closest ancestors · 22
Same direction, newest first
- 2025Think Before You Accept: Semantic Reflective Verification for Faster Speculative Decoding24 May
- 2025KNN-SSD: Enabling Dynamic Self-Speculative Decoding via Nearest Neighbor Layer Set Optimization22 May
- 2025Alignment-Augmented Speculative Decoding with Alignment Sampling and Conditional Verification19 May
- 2025AutoJudge: Judge Decoding Without Manual Annotation28 Apr
- 2025ML-SpecQD: Multi-Level Speculative Decoding with Quantized Drafts17 Mar
- 2025Gumiho: A Hybrid Architecture to Prioritize Early Tokens in Speculative Decoding13 Mar
- 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
- 2025Speeding up Speculative Decoding via Sequential Approximate Verification6 Feb
- 2025Judge Decoding: Faster Speculative Sampling Requires Going Beyond Model Alignment31 Jan
- 2024SpecHub: Provable Acceleration to Multi-Draft Speculative Decoding8 Nov
- 2024SWIFT: On-the-Fly Self-Speculative Decoding for LLM Inference Acceleration9 Oct
- 2024ParallelSpec: Parallel Drafter for Efficient Speculative Decoding8 Oct
10 more
- 2024Learning Harmonized Representations for Speculative Sampling28 Aug
- 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
- 2024Kangaroo: Lossless Self-Speculative Decoding via Double Early Exiting29 Apr
- 2024Hydra: Sequentially-Dependent Draft Heads for Medusa Decoding7 Feb
- 2024GliDe with a CaPE: A Low-Hassle Method to Accelerate Speculative Decoding3 Feb
- 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
- 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
- 2023REST: Retrieval-Based Speculative Decoding14 Nov
- 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
- 2022Speculative Decoding: Exploiting Speculative Execution for Accelerating Seq2seq Generation30 Mar
Other references · 13
- 2017Attention Is All You Needcited by 59,932
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2021Program Synthesis with Large Language Modelscited by 3,509
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,270
- 2024Qwen2.5-Coder Technical Reportcited by 1,151
- 2022Language Models are Multilingual Chain-of-Thought Reasonerscited by 518
- 2018Blockwise Parallel Decoding for Deep Autoregressive Modelscited by 318
- 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 302
- 2023Automatically Correcting Large Language Models: Surveying the landscape of diverse self-correction strategiescited by 236
- 2024Turning Trash into Treasure: Accelerating Inference of Large Language Models with Token Recyclingcited by 48
- 2023Lookahead: An Inference Acceleration Framework for Large Language Model with Lossless Generation Accuracycited by 37
1 more
- 2024ACPBench: Reasoning about Action, Change, and Planningcited by 37
Built on by
Citing papers per year: 2026: 11.
11 papers.
- 2026HeiSD: Hybrid Speculative Decoding for Embodied Vision-Language-Action Models with Kinematic Awarenesscited by 6
- 2026MARS: Unleashing the Power of Speculative Decoding via Margin-Aware Verificationcited by 5
- 2026See the Forest for the Trees: Loosely Speculative Decoding via Visual-Semantic Guidance for Efficient Inference of Video LLMscited by 5
- 2026WISV: Wireless-Informed Semantic Verification for Distributed Speculative Decoding in Device-Edge LLM Inferencecited by 1
- 2026SENSE: Semantic Embedding Navigation with Soft-gated Evaluation for Retrieval-based Speculative Decodingcited by 1
- 2026Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decodingcited by 1
- 2026Calibrated Speculative Decoding: Frequency-Guided Candidate Selection for Efficient Inferencecited by 0
- 2026Faster LLM Inference via Sequential Monte Carlocited by 0
- 2026Beyond the Target: From Imitation to Collaboration in Speculative Decodingcited by 0
- 2026Oilbird: Training-Free Speculative Decoding with Keys the Verifier Already Computescited by 0
- 2026Secure Speculative Decoding for Large Language Modelscited by 0
- 2026Secure Speculative Decoding for Large Language Models6 Oct 2026
- 2026Oilbird: Training-Free Speculative Decoding with Keys the Verifier Already Computes4 Aug 2026
- 2026Margins, Not Windows: Training-Free Per-Step Lossy Speculative Decoding3 Jul 2026
- 2026Beyond the Target: From Imitation to Collaboration in Speculative Decoding24 May 2026
- 2026WISV: Wireless-Informed Semantic Verification for Distributed Speculative Decoding in Device-Edge LLM Inference20 Apr 2026
- 2026Faster LLM Inference via Sequential Monte Carlo17 Apr 2026
- 2026Calibrated Speculative Decoding: Frequency-Guided Candidate Selection for Efficient Inference15 Apr 2026
- 2026SENSE: Semantic Embedding Navigation with Soft-gated Evaluation for Retrieval-based Speculative Decoding14 Apr 2026
- 2026See the Forest for the Trees: Loosely Speculative Decoding via Visual-Semantic Guidance for Efficient Inference of Video LLMs7 Apr 2026
- 2026HeiSD: Hybrid Speculative Decoding for Embodied Vision-Language-Action Models with Kinematic Awareness18 Mar 2026
- 2026MARS: Unleashing the Power of Speculative Decoding via Margin-Aware Verification21 Jan 2026
Similar, not cited
Close in wording, no citation either way
- 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding
- 2025Speculative Verification: Exploiting Information Gain to Refine Speculative Decoding
- 2025Draft, Verify, and Improve: Toward Training-Aware Speculative Decoding
- 2026Verification-Aware Training for Speculative Decoding
- 2026A Practical Investigation of Training-free Relaxed Speculative Decoding
- 2026From Tokens to Steps: Verification-Aware Speculative Decoding for Efficient Multi-Step Reasoning
- 2024Closer Look at Efficient Inference Methods: A Survey of Speculative Decoding
- 2024AdaEDL: Early Draft Stopping for Speculative Decoding of Large Language Models via an Entropy-based Lower Bound on Token Acceptance Probability