SENSE: Semantic Embedding Navigation with Soft-gated Evaluation for Retrieval-based Speculative Decoding
On the map: Efficient LLM inference and serving → Speculative decoding
Abstract (arXiv)
Speculative Decoding (SD) accelerates Large Language Model (LLM) inference by employing a lightweight draft model to propose candidate tokens, which are verified in parallel by the target model, without compromising generation quality. While Retrieval-based Speculative Decoding (RSD) is favored for its plug-and-play versatility, its potential is impeded by rigid lexical dependencies, rendering both retrieval and verification brittle to surface-level variations. To address this, we propose SENSE (Semantic Embedding Navigation with Soft-gated Evaluation). By anchoring retrieval on the hidden states of the target model, SENSE establishes robust semantic alignment, which empowers the Soft-gated Evaluation module to validate semantic equivalence rather than surface forms. To ensure rigorous benchmarking, we deconstruct existing methods into atomic primitives within a unified framework, facilitating granular, component-level comparison. Extensive experiments across diverse domains demonstrate that SENSE outperforms multiple baselines on the LLaMA and Qwen families, attaining up to 4.09 mean acceptance length and 3.26x speedup, while preserving generation quality. Our code will be released upon publication.
Key facts. Cited by 1 paper in the map (data through 14 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 14 Apr 2026.
Builds on
29 of 39 references.
Closest ancestors · 18
Same direction, newest first
- 2025SpecPV: Improving Self-Speculative Decoding for Long-Context Generation via Partial Verification2 Dec
- 2025Training-Free Loosely Speculative Decoding: Accepting Semantically Correct Drafts Beyond Exact Match28 Nov
- 2025LogitSpec: Accelerating Retrieval-based Speculative Decoding via Next Next Token Speculation2 Jul
- 2025Alignment-Augmented Speculative Decoding with Alignment Sampling and Conditional Verification19 May
- 2025AutoJudge: Judge Decoding Without Manual Annotation28 Apr
- 2025Speculative Decoding and Beyond: An In-Depth Survey of Techniques27 Feb
- 2025DReSD: Dense Retrieval for Speculative Decoding21 Feb
- 2025Judge Decoding: Faster Speculative Sampling Requires Going Beyond Model Alignment31 Jan
- 2024PLD+: Accelerating LLM inference by leveraging Language Model Artifacts2 Dec
- 2024Closer Look at Efficient Inference Methods: A Survey of Speculative Decoding20 Nov
- 2024SAM Decoding: Speculative Decoding via Suffix Automaton16 Nov
- 2024The N-Grammys: Accelerating Autoregressive Inference with Learning-Free Batched Speculation6 Nov
6 more
- 2024OPT-Tree: Speculative Decoding with Adaptive Draft Tree Structure25 Jun
- 2024Sequoia: Scalable, Robust, and Hardware-aware Speculative Decoding19 Feb
- 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
- 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
- 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification16 May
- 2022Fast Inference from Transformers via Speculative Decoding30 Nov
Other references · 11
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,297
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
- 2019The Curious Case of Neural Text Degenerationcited by 2,916
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 861
- 2022GLM-130B: An Open Bilingual Pre-trained Modelcited by 843
- 2023Enhancing Chat Language Models by Scaling High-quality Instructional Conversationscited by 839
- 2024A Survey on Efficient Inference for Large Language Modelscited by 205
- 2023Inference with Reference: Lossless Acceleration of Large Language Modelscited by 65
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026AdaPLD: Adaptive Retrieval and Reuse for Efficient Model-Free Speculative Decoding
- 2026Beyond Tokens: Semantic-Aware Speculative Decoding for Efficient Inference by Probing Internal States
- 2026RACER: Retrieval-Augmented Contextual Rapid Speculative Decoding
- 2023REST: Retrieval-Based Speculative Decoding
- 2025RAPID: Long-Context Inference with Retrieval-Augmented Speculative Decoding
- 2026SPEED-Bench: A Unified and Diverse Benchmark for Speculative Decoding
- 2026TSS: Target-Side Sparsification for Speculative Decoding in Domain-Specific Large Language Models
- 2025Think Before You Accept: Semantic Reflective Verification for Faster Speculative Decoding