mlsanityData to 14 Oct 2026

Bastion: Budget-Aware Speculative Decoding with Tree-structured Block Diffusion Drafting

arXiv 2605.29727 ↗First posted 28 May 2026cs.LGcited by 2

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

Abstract (arXiv)

Block-diffusion drafters have recently emerged as a powerful alternative for speculative decoding by predicting multiple future-token distributions in a single parallel step. However, since these parallel predictions are sampled from position-wise marginals rather than fully conditioned sequences, committing to a single greedy path often fails to capture the target model's preferred trajectory. To address this, we propose BASTION, a budget-aware speculative decoding framework with tree-based diffusion drafting. Unlike existing methods that rely on static tree topologies, BASTION dynamically constructs query-dependent trees by balancing draft quality against hardware constraints. Our framework integrates three synergistic components: (1) an acceptance surrogate that estimates expected accepted length via path confidence, (2) an online latency estimator that calibrates a hardware-aware roofline model, and (3) an adaptive best-first expansion that grows the tree until marginal gains no longer justify incremental verification costs. BASTION is training-free, preserves the target model's distribution, and requires no per-setting tuning. Across diverse benchmarks and GPU architectures, BASTION achieves up to a 6.61x speedup over standard autoregressive decoding, outperforming state-of-the-art block-diffusion baselines by 39%.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 60 of its 64 references that are in the map. First posted on arXiv 28 May 2026.

Builds on

60 of 64 references.

Closest ancestors · 26

Same direction, newest first

  1. 2026Accelerating Speculative Decoding with Block Diffusion Draft Trees14 Apr
  2. 2026DFlash: Block Diffusion for Flash Speculative Decoding5 Feb
  3. 2026Multi-Token Prediction via Self-Distillation5 Feb
  4. 2025Yggdrasil: Bridging Dynamic Speculation and Static Runtime for Latency-Optimal Tree-Based LLM Decoding29 Dec
  5. 2025DiffuSpec: Unlocking Diffusion Language Models for Speculative Decoding28 Sep
  6. 2025LogitSpec: Accelerating Retrieval-based Speculative Decoding via Next Next Token Speculation2 Jul
  7. 2025STree: Speculative Tree Decoding for Hybrid State-Space Models20 May
  8. 2025PARD: Accelerating LLM Inference with Low-Cost PARallel Draft Model Adaptation23 Apr
  9. 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
  10. 2025Judge Decoding: Faster Speculative Sampling Requires Going Beyond Model Alignment31 Jan
  11. 2024AdaEAGLE: Optimizing Speculative Decoding via Explicit Modeling of Adaptive Draft Structures25 Dec
  12. 2024MagicDec: Breaking the Latency-Throughput Tradeoff for Long Context Generation with Speculative Decoding20 Aug
14 more
  1. 2024PEARL: Parallel Speculative Decoding with Adaptive Draft Length13 Aug
  2. 2024OPT-Tree: Speculative Decoding with Adaptive Draft Tree Structure25 Jun
  3. 2024EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees24 Jun
  4. 2024SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths30 May
  5. 2024Sequoia: Scalable, Robust, and Hardware-aware Speculative Decoding19 Feb
  6. 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decoding3 Feb
  7. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty26 Jan
  8. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads19 Jan
  9. 2023SpecTr: Fast Speculative Decoding via Optimal Transport23 Oct
  10. 2023Fast and Robust Early-Exiting Framework for Autoregressive Language Models with Synchronized Parallel Decoding9 Oct
  11. 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification16 May
  12. 2023Speculative Decoding with Big Little Decoder15 Feb
  13. 2023Accelerating Large Language Model Decoding with Speculative Sampling2 Feb
  14. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 34

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2024The Llama 3 Herd of Modelscited by 14,715
  3. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  4. 2025Qwen3 Technical Reportcited by 8,820
  5. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
  6. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  7. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,403
  8. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
  9. 2025Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilitiescited by 3,796
  10. 2021Program Synthesis with Large Language Modelscited by 3,637
  11. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
  12. 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 2,004
22 more
  1. 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,417
  2. 2025gpt-oss-120b & gpt-oss-20b Model Cardcited by 1,386
  3. 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 1,040
  4. 2022Diffusion-LM Improves Controllable Text Generationcited by 1,027
  5. 2025Large Language Diffusion Modelscited by 912
  6. 2019SAMSum Corpus: A Human-annotated Dialogue Dataset for Abstractive Summarizationcited by 535
  7. 2021A Dataset of Information-Seeking Questions and Answers Anchored in Research Paperscited by 486
  8. 2017Non-Autoregressive Neural Machine Translationcited by 463
  9. 2019Multi-News: a Large-Scale Multi-Document Summarization Dataset and Abstractive Hierarchical Modelcited by 431
  10. 2025Fast-dLLM: Training-free Acceleration of Diffusion LLM by Enabling KV Cache and Parallel Decodingcited by 420
  11. 2025Block Diffusion: Interpolating Between Autoregressive and Diffusion Language Modelscited by 409
  12. 2024Better & Faster Large Language Models via Multi-token Predictioncited by 360
  13. 2021Efficient Attentions for Long Document Summarizationcited by 345
  14. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 307
  15. 2022SSD-LM: Semi-autoregressive Simplex-based Diffusion Language Model for Text Generation and Modular Controlcited by 194
  16. 2025Fast-dLLM v2: Efficient Block-Diffusion LLMcited by 139
  17. 2023AR-Diffusion: Auto-Regressive Diffusion Model for Text Generationcited by 118
  18. 2024LANTERN: Accelerating Visual Autoregressive Models with Relaxed Speculative Decodingcited by 47
  19. 2025Your LLM Knows the Future: Uncovering Its Multi-Token Prediction Potentialcited by 47
  20. 2025TiDAR: Think in Diffusion, Talk in Autoregressioncited by 37
  21. 2025LANTERN++: Enhancing Relaxed Speculative Decoding with Static Tree Drafting for Visual Auto-regressive Modelscited by 11
  22. 2026AngelSlim: A more accessible, comprehensive, and efficient toolkit for large model compressioncited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Cost-Aware Diffusion Draft Trees for Speculative Decoding
  2. 2026Tsubame: Tree Replay for Diffusion-Based Speculative Decoding
  3. 2026TAPS: Target-Aware Prefix Tree Selection for Diffusion-Drafted Speculative Decoding
  4. 2026CAST: Cost-Aware Speculative Trees from One-Pass Block Drafters
  5. 2026DScale: Scaling Block-Diffusion Speculative Decoding with Adaptive Verification
  6. 2026JetSpec: Breaking the Scaling Ceiling of Speculative Decoding with Parallel Tree Drafting
  7. 2026TreeFlash: Parallel AR-Approximation for Faster Speculative Decoding
  8. 2026SpecBlock: Block-Iterative Speculative Decoding with Dynamic Tree Drafting