DominoTree: Conditional Tree-Structured Drafting with Domino for Speculative Decoding

· Source: Computation and Language · Field: Technology & Digital — Artificial Intelligence & Machine Learning, Software Development & Engineering, Natural Language Processing · Depth: Expert, quick

Summary

DominoTree is a novel, training-free method designed to accelerate Large Language Model (LLM) inference through speculative decoding. It enhances existing best-first tree methods like DDTree by integrating the Domino drafter's GRU-based causal correction, which models path-dependent token distributions, a feature not supported by DDTree's factorized formulation. DominoTree achieves significant performance gains, demonstrating up to a 6.6x speedup over autoregressive decoding on Qwen3-4B across eight benchmarks, with a mean accept length of up to 10.7 tokens per round. Its GPU-native, CUDA-graph builder ensures efficient tree construction, leading to a 9-10% overall throughput increase on Qwen3-4B and up to +22% on Alpaca compared to the released Domino decoder. On Qwen3-8B, DominoTree maintains the highest accepted length and delivers a +24% throughput advantage over DDTree at T=0.

Key takeaway

For Machine Learning Engineers optimizing LLM inference, DominoTree offers a compelling solution to significantly boost throughput and accepted token length. If you are deploying models like Qwen3-4B or Qwen3-8B, consider integrating this training-free speculative decoding method. It can deliver up to 6.6x speedup and 9-24% higher throughput over existing methods, directly impacting your operational efficiency and cost. Evaluate its GPU-native builder for immediate performance gains.

Key insights

DominoTree accelerates LLM inference via conditional tree-structured drafting, achieving significant speedups and higher token acceptance lengths.

Principles

Method

DominoTree constructs a training-free, best-first draft tree. It scores paths using Domino's conditional, non-factorized correction, restricting per-node correction to a top-M candidate set, and uses a GPU-native CUDA-graph builder.

In practice

Topics

Best for: AI Engineer, Research Scientist, AI Scientist, Machine Learning Engineer, NLP Engineer

Related on AIssential

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by Computation and Language.