Draft in Parallel, Condition Through Depth: Adjacent Causal Injection for Speculative Decoding
cs.LG, cs.AI
Submitted: 2026-09-28
Updated: 2026-10-10
Project page: https://dspine-project.github.io
License: http://creativecommons.org/licenses/by/4.0/
The gist: Parallel speculative drafting generates multiple candidates in one backbone pass, but independent token selection can produce inconsistent continuations that shorten the accepted prefix.
Terminology
Abstract
Parallel speculative drafting generates multiple candidates in one backbone pass, but independent token selection can produce inconsistent continuations that shorten the accepted prefix. Existing methods mostly leave conditional decoding to a lightweight module after the backbone, which limits the flow of predecessor information to successors. Our analysis of DFlash shows that early positions already form recoverable predictions in shallow layers, and that accurate adjacent predecessors help successors more when they enter earlier. We therefore propose DSpine, a drafter with causal conditioning injection throughout the backbone: at every layer, gated adjacent injection writes each predecessor's predicted feature into its successor, so the causal conditioning chain unfolds over network depth while all positions update in parallel. A unified transfer space built from the target model's output embeddings unifies layer-wise injection with predecessor-conditioned decoding, and layer-wise output-embedding supervision promotes the formation of predicted features in shallow layers. Fused kernels and a transition cache execute both efficiently in parallel within SGLang. Across seven math, code, and chat benchmarks, DSpine achieves the longest acceptance length at both temperatures on Qwen3-4B and Qwen3-8B. At temperature zero on Qwen3-8B, it raises the seven-benchmark mean from DFlash's 3.77 to 4.82 (+27.8%); in SGLang serving tests, it delivers 23.3% higher throughput than DFlash on average. Project page: https://dspine-project.github.io
Sources
- Domino: Decoupling Causal Modeling from Autoregressive Drafting in Speculative Decoding
- DSpark: Confidence-Scheduled Speculative Decoding with Semi-Autoregressive Generation
- DFlare: Scaling Up Draft Capacity for Block Diffusion Speculative Decoding
- Accelerating Large Language Model Decoding with Speculative Sampling
- DART: Diffusion-Inspired Speculative Decoding for Fast LLM Inference
- ASPD: Unlocking Adaptive Serial-Parallel Decoding by Exploring Intrinsic Parallelism in LLMs
- D-PACE: Dynamic Position-Aware Cross-Entropy for Parallel Speculative Drafting
- Accelerating Speculative Decoding with Block Diffusion Draft Trees
- TreeFlash: Parallel AR-Approximation for Faster Speculative Decoding
- xPress: Parallel Refinement for Diffusion Drafters in Speculative Decoding
- LiLiCorr: Lightweight Likelihood Correlation of Parallel Drafts for Speculative Decoding
- JetSpec: Breaking the Scaling Ceiling of Speculative Decoding with Parallel Tree Drafting
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks