Research
DForkTree Speeds Speculative Decoding With Fork-Aware Draft Trees
DForkTree is a training-free speculative decoding method that re-anchors block-diffusion draft-tree branches on their own tokens. It adds n-gram pointwise mutual information from the target model's outputs to drafter scores, weights those scores more after a fork, and builds the optimal tree on the GPU. On Qwen3.5-4B and 9B, with shared drafter, tree pipeline, and verifier, it was the fastest tree method on every benchmark, up to 41.5% faster than DFlash and 15.1% faster than DDTree, with average speedups of up to 4.75x over autoregressive decoding.
Speculative decodingBlock diffusionLLM inference acceleration