Double: Breaking the Acceleration Limit via Double Retrieval Speculative Parallelism
On the map: Efficient LLM inference and serving → Speculative decoding
Abstract (arXiv)
Parallel Speculative Decoding (PSD) accelerates traditional Speculative Decoding (SD) by overlapping draft generation with verification. However, it remains hampered by two fundamental challenges: (1) a theoretical speedup ceiling dictated by the speed ratio between the draft and target models, and (2) high computational waste and pipeline stall due to mid-sequence token rejections of early errors. To address these limitations, we introduce textscDouble (Double Retrieval Speculative Parallelism). By bridging the gap between SD and PSD, our framework resolves the Retrieval Precision-Efficiency Dilemma through a novel synchronous mechanism. Specifically, we enable the draft model to execute iterative retrieval speculations to break the theoretical speedup limits; to alleviate rejections without rollback, the target model performs authoritative retrieval to generate multi-token guidance. textscDouble is entirely training-free and lossless. Extensive experiments demonstrate state-of-the-art speedup of 5.3× on LLaMA3.3-70B and 2.8× on Qwen3-32B, significantly outperforming the advanced method EAGLE-3 that requires extensive model training.
Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. First posted on arXiv 9 Jan 2026.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2026: 16.
16 papers.
Sort:
By area:
- 2026OPID: On-Policy Skill Distillation for Agentic Reinforcement Learningcited by 32
- 2026SEED: Self-Evolving On-Policy Distillation for Agentic Reinforcement Learningcited by 32
- 2026ECHO: Elastic Speculative Decoding with Sparse Gating for High-Concurrency Scenarioscited by 12
- 2026Efficient Inference for Large Vision-Language Models: Bottlenecks, Techniques, and Prospectscited by 9
- 2026StreamMeCo: Long-Term Agent Memory Compression for Efficient Streaming Video Understandingcited by 9
- 2026FBS: Modeling Native Parallel Reading inside a Transformercited by 7
- 2026Draft Less, Retrieve More: Hybrid Tree Construction for Speculative Decodingcited by 6
- 2026PERM: Psychology-grounded Empathetic Reward Modeling for Large Language Modelscited by 5
- 2026See the Forest for the Trees: Loosely Speculative Decoding via Visual-Semantic Guidance for Efficient Inference of Video LLMscited by 5
- 2026When Hidden States Drift: Can KV Caches Rescue Long-Range Speculative Decoding?cited by 5
- 2026D-cut: Adaptive Verification Depth Pruning for Batched Speculative Decodingcited by 5
- 2026FACT-E: Causality-Inspired Evaluation for Trustworthy Chain-of-Thought Reasoningcited by 4
4 more
- 2026TailSieve: Partial-Rollout-Guided Tail Routing for LLM Rolloutscited by 2
- 2026FlowHijack: A Dynamics-Aware Backdoor Attack on Flow-Matching Vision-Language-Action Modelscited by 1
- 2026Semiotic logical hexagon theory for LLM logical reasoningcited by 1
- 2026SPECTRE: Hybrid Ordinary-Parallel Speculative Serving for Resource-Efficient LLM Inferencecited by 0
- 2026TailSieve: Partial-Rollout-Guided Tail Routing for LLM Rollouts24 Aug 2026
- 2026Semiotic logical hexagon theory for LLM logical reasoning24 Jul 2026
- 2026SEED: Self-Evolving On-Policy Distillation for Agentic Reinforcement Learning16 Jul 2026
- 2026D-cut: Adaptive Verification Depth Pruning for Batched Speculative Decoding16 Jul 2026
- 2026OPID: On-Policy Skill Distillation for Agentic Reinforcement Learning25 Jun 2026
- 2026Draft Less, Retrieve More: Hybrid Tree Construction for Speculative Decoding19 May 2026
- 2026SPECTRE: Hybrid Ordinary-Parallel Speculative Serving for Resource-Efficient LLM Inference4 May 2026
- 2026When Hidden States Drift: Can KV Caches Rescue Long-Range Speculative Decoding?29 Apr 2026
- 2026FACT-E: Causality-Inspired Evaluation for Trustworthy Chain-of-Thought Reasoning12 Apr 2026
- 2026StreamMeCo: Long-Term Agent Memory Compression for Efficient Streaming Video Understanding10 Apr 2026
- 2026See the Forest for the Trees: Loosely Speculative Decoding via Visual-Semantic Guidance for Efficient Inference of Video LLMs7 Apr 2026
- 2026Efficient Inference for Large Vision-Language Models: Bottlenecks, Techniques, and Prospects7 Apr 2026
4 more
- 2026FlowHijack: A Dynamics-Aware Backdoor Attack on Flow-Matching Vision-Language-Action Models30 Mar 2026
- 2026ECHO: Elastic Speculative Decoding with Sparse Gating for High-Concurrency Scenarios10 Mar 2026
- 2026FBS: Modeling Native Parallel Reading inside a Transformer29 Jan 2026
- 2026PERM: Psychology-grounded Empathetic Reward Modeling for Large Language Models15 Jan 2026
- 2026ECHO: Elastic Speculative Decoding with Sparse Gating for High-Concurrency Scenarioscited by 12
- 2026Draft Less, Retrieve More: Hybrid Tree Construction for Speculative Decodingcited by 6
- 2026See the Forest for the Trees: Loosely Speculative Decoding via Visual-Semantic Guidance for Efficient Inference of Video LLMscited by 5
- 2026When Hidden States Drift: Can KV Caches Rescue Long-Range Speculative Decoding?cited by 5
- 2026SPECTRE: Hybrid Ordinary-Parallel Speculative Serving for Resource-Efficient LLM Inferencecited by 0
- 2026Draft Less, Retrieve More: Hybrid Tree Construction for Speculative Decoding19 May 2026
- 2026SPECTRE: Hybrid Ordinary-Parallel Speculative Serving for Resource-Efficient LLM Inference4 May 2026
- 2026When Hidden States Drift: Can KV Caches Rescue Long-Range Speculative Decoding?29 Apr 2026
- 2026See the Forest for the Trees: Loosely Speculative Decoding via Visual-Semantic Guidance for Efficient Inference of Video LLMs7 Apr 2026
- 2026ECHO: Elastic Speculative Decoding with Sparse Gating for High-Concurrency Scenarios10 Mar 2026
Similar, not cited
Close in wording, no citation either way
- 2025CARD: A Cache-Assisted Parallel Speculative Decoding Framework via Query-and-Correct Paradigm for Accelerating LLM Inference
- 2026Speculative Speculative Decoding
- 2026PARD-2: Target-Aligned Parallel Draft Model for Dual-Mode Speculative Decoding
- 2025LogitSpec: Accelerating Retrieval-based Speculative Decoding via Next Next Token Speculation
- 2025SpecBranch: Speculative Decoding via Hybrid Drafting and Rollback-Aware Branch Parallelism
- 2025DuoDecoding: Hardware-aware Heterogeneous Speculative Decoding with Dynamic Multi-Sequence Drafting
- 2026SPEED-Bench: A Unified and Diverse Benchmark for Speculative Decoding
- 2025DReSD: Dense Retrieval for Speculative Decoding