Sign inGet started
Paper · arXiv

Tsubame: Tree Replay for Diffusion-Based Speculative Decoding

Context-aware dynamic trees allocate the speculative decoding budget according to draft path probabilities, adapting their depth and branching to the current context. Under stochastic decoding, however, we find that this structural advantage does not always compensate for the acceptance gains of random sampling paired with advanced verification, and such dynamic trees can fall behind sampled chains in some settings. These trees grow their topology from the candidates themselves, so the tokens submitted for verification are typically the deterministic high-score tokens selected during construction. This coupling is not inherent: once the topology is fixed, its nodes can be repopulated by s...

AuthorsYepeng Weng, Qiao Hu, Takehisa Yairi
Primary categorycs.CL
Published27 September 2026
Last updated at source27 September 2026
cs.CLcs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/caec36d7-ecd4-4d68-835f-4a243b31ee5a" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.