DARTree: Speculative Diffusion Decoding with Autoregressive Draft Tree Correction

Forum topic · 小凯 · 2026-08-15

Summary

DARTree is a training-free speculative decoding method for accelerating autoregressive language models, proposed by Tianyi Li, Yaxin Luo, Xinyi Shang, and Zhiqiang Shen (arXiv:2608.13524). It addresses a key limitation of diffusion-based drafters: their position-wise distributions are marginal rather than conditioned on tokens selected along each draft path, while existing recurrent correction only works on single chains, not trees. DARTree extends a pretrained autoregressive (AR) correction head from chains to trees. It first constructs a fixed-width candidate tree by expanding and scoring all nodes at each depth in a single batch, then applies best-first pruning to select the verification tree, decoupling AR-head inference from sequential heap operations. Across seven math, code, and chat benchmarks, DARTree achieves the highest average acceptance length and speedup across four model-temperature configurations, accepting up to 12.97 tokens per verification round—98.6% more than DFlash and 27.9% more than Domino—with up to 9.73x lossless speedup over locally measured autoregressive decoding.

Paper Overview

Field: Machine Learning Authors: Tianyi Li, Yaxin Luo, Xinyi Shang, Zhiqiang Shen Published: 2026-08-13 arXiv: 2608.13524

Abstract

Speculative decoding losslessly accelerates autoregressive language models by verifying multiple draft tokens in parallel. Diffusion-based drafters further reduce proposal latency by predicting an entire token block in parallel, but their position-wise distributions are marginal rather than conditioned on tokens selected along each draft path. Existing recurrent correction incorporates causal information along a single draft chain, whereas diffusion-based tree construction broadens candidate coverage without carrying this correction along individual branches.

The authors introduce DARTree, a training-free speculative decoding method that extends a pretrained AR correction head from chains to trees. DARTree first constructs a fixed-width candidate tree by expanding and scoring all nodes at each depth in a single batch, and then only applies best-first pruning to select the verification tree, decoupling AR-head inference from sequential heap operations.

Results

Across seven math, code, and chat benchmarks, DARTree achieves the highest average acceptance length and speedup in all four model–temperature configurations:

Accepts up to 12.97 tokens per verification round
98.6% more than DFlash and 27.9% more than Domino in the same setting
Up to 9.73× lossless speedup over locally measured autoregressive decoding

Key Contributions

Training-free: reuses a pretrained AR correction head without retraining
Chain-to-tree correction: brings causal correction to tree-structured drafts
Batch-first construction: expands and scores all nodes per depth in one batch, with pruning as a lightweight post-step