mlsanityData to 7 Oct 2026

DeLS-Spec: Decoupled Long-Short Contexts for Parallel Speculative Drafting

arXiv 2607.07409 ↗First posted 8 Jul 2026cs.CLcited by 2

On the map: Efficient LLM inference and serving → Speculative decoding

Abstract (arXiv)

Speculative decoding accelerates LLM inference by drafting multiple tokens and verifying them in parallel. Block-parallel drafters such as DFlash further improve drafting efficiency by predicting an entire block in one pass, but their position-wise predictions lack explicit intra-block causal conditioning. Recent methods such as Domino and DSpark attempt to introduce such causality into block-parallel drafting, but they require training the draft model from scratch, which limits their flexibility and increases training cost. We propose DeLS-Spec, a decoupled long-short context speculative decoding method. DeLS-Spec treats the fixed DFlash model as a long-context expert and introduces a lightweight local head as a short-context expert. The local head can be trained independently with a standard next-token prediction objective, without joint training with the target model or the DFlash backbone, leading to extremely low training cost. At inference time, DeLS-Spec combines long-context and short-context logits, and the local head is not tied to a specific DFlash checkpoint, making the method more modular and flexible. Experiments on Qwen3 models show that DeLS-Spec consistently improves speedup and average acceptance length over DFlash across math, code, and dialogue benchmarks.

Key facts. Cited by 2 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 40 of its 45 references that are in the map. First posted on arXiv 8 Jul 2026.

Builds on

40 of 45 references.

Closest ancestors · 23

Same direction, newest first

  1. 2026DSpark: Confidence-Scheduled Speculative Decoding with Semi-Autoregressive Generation6 Jul
  2. 2026JetSpec: Breaking the Scaling Ceiling of Speculative Decoding with Parallel Tree Drafting16 Jun
  3. 2026TreeFlash: Parallel AR-Approximation for Faster Speculative Decoding2 Jun
  4. 2026Domino: Decoupling Causal Modeling from Autoregressive Drafting in Speculative Decoding28 May
  5. 2026D-PACE: Dynamic Position-Aware Cross-Entropy for Parallel Speculative Drafting12 May
  6. 2026Accelerating Speculative Decoding with Block Diffusion Draft Trees14 Apr
  7. 2026DFlash: Block Diffusion for Flash Speculative Decoding5 Feb
  8. 2026DART: Diffusion-Inspired Speculative Decoding for Fast LLM Inference27 Jan
  9. 2025SpecDiff-2: Scaling Diffusion Drafter Alignment For Faster Speculative Decoding1 Nov
  10. 2025DiffuSpec: Unlocking Diffusion Language Models for Speculative Decoding28 Sep
  11. 2025PARD: Accelerating LLM Inference with Low-Cost PARallel Draft Model Adaptation23 Apr
  12. 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
11 more
  1. 2024Speculative Decoding with CTC-based Draft Model for LLM Inference Acceleration25 Nov
  2. 2024Speculative Diffusion Decoding: Accelerating Language Generation through Diffusion10 Aug
  3. 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
  4. 2024Recurrent Drafter for Fast Speculative Decoding in Large Language Models14 Mar
  5. 2024Hydra: Sequentially-Dependent Draft Heads for Medusa Decoding7 Feb
  6. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  7. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
  8. 2023DistillSpec: Improving Speculative Decoding via Knowledge Distillation12 Oct
  9. 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification16 May
  10. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  11. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 17

  1. 2023GPT-4 Technical Reportcited by 18,132
  2. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  3. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  4. 2025Qwen3 Technical Reportcited by 8,195
  5. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  6. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
  7. 2021Program Synthesis with Large Language Modelscited by 3,509
  8. 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
  9. 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 1,906
  10. 2025Large Language Diffusion Modelscited by 872
  11. 2015Scheduled Sampling for Sequence Prediction with Recurrent Neural Networkscited by 779
  12. 2017Non-Autoregressive Neural Machine Translationcited by 457
5 more
  1. 2025Block Diffusion: Interpolating Between Autoregressive and Diffusion Language Modelscited by 385
  2. 2018Blockwise Parallel Decoding for Deep Autoregressive Modelscited by 318
  3. 2025SDAR: A Synergistic Diffusion-AutoRegression Paradigm for Scalable Sequence Generationcited by 118
  4. 2019Fast Structured Decoding for Sequence Modelscited by 59
  5. 2025TiDAR: Think in Diffusion, Talk in Autoregressioncited by 35

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026SpecBlock: Block-Iterative Speculative Decoding with Dynamic Tree Drafting
  2. 2026DFlare: Scaling Up Draft Capacity for Block Diffusion Speculative Decoding
  3. 2026Carryover Drafting: Recycling Rejected States for Speculative Decoding
  4. 2026Draft in Parallel, Condition Through Depth: Adjacent Causal Injection for Speculative Decoding
  5. 2025FastEagle: Cascaded Drafting for Accelerating Speculative Decoding
  6. 2026LongSpark: Efficient speculative decoding with a fixed-cost parallel drafter
  7. 2026Speculative Pipeline Decoding: Higher-Accuracy Drafting with Hidden Latency via Pipeline Parallelism
  8. 2026Training Parallel Speculative Draft Models by Directly Minimizing Expected Decoding Rounds