TAPS: 面向扩散草稿推测解码的目标感知前缀树选择
TAPS: Target-Aware Prefix Tree Selection for Diffusion-Drafted Speculative Decoding
AI总结:
提出TAPS方法,通过目标感知的前缀树选择优化扩散模型草稿的验证效率,实现最高7.9倍无损加速。
摘要:
使用扩散模型进行并行草稿是推测解码的一种有前景的方法。通过在单次前向传播中预测多个未来位置的token,扩散草稿器显著降低了草稿延迟。然而,这会将瓶颈转移到验证上:验证单个序列限制了接受长度,而验证大型草稿树会导致过度的目标模型延迟。我们发现了现有草稿树方法中的一个关键不匹配:现有的扩散树方法按边际概率对节点排序,忽略了验证是前缀条件化的。因此,它们可能会验证被拒绝前缀的不可达后代,从而增加延迟而接受增益有限。为了解决这个问题,我们提出了TAPS,一种目标感知的前缀选择方法,将扩散边际转化为路径条件化的接受估计。然后,TAPS在固定的验证预算下选择一个紧凑的前缀封闭子树,改善接受-成本权衡,而不是简单地扩展草稿树。跨不同数据集和模型族的实验表明,TAPS在无损端到端速度上比普通自回归解码最高提升7.9倍,分别比最先进的DFlash和DDTree提升1.36倍和1.74倍。我们的工作可在https://anonymous.4open.science/r/TAPS-EMNLP2026-53DD获取。
英文摘要:
Using a diffusion model for parallel drafting is a promising approach for speculative decoding. By predicting tokens at multiple future positions in a single forward pass, diffusion drafters substantially reduce drafting latency. However, this shifts the bottleneck to verification: verifying a single sequence limits acceptance length, while verifying large draft trees incurs excessive target-model latency. We identify a key mismatch in existing draft-tree methods: existing diffusion-tree methods rank nodes by the marginal probability, ignoring that verification is prefix-conditioned. As a result, they may verify unreachable descendants of rejected prefixes, increasing latency with limited acceptance gains. To address this, we propose TAPS, a target-aware prefix selection method that turns diffusion marginals into path-conditioned acceptance estimates. TAPS then selects a compact prefix-closed subtree under a fixed verification budget, improving the acceptance-cost tradeoff rather than simply expanding the draft tree. Experiments across diverse datasets and model families demonstrate that TAPS achieves up to 7.9x lossless end-to-end speedup over vanilla autoregressive decoding, outperforming state-of-the-art DFlash and DDTree by 1.36x and 1.74x respectively. Our work is available at https://anonymous.4open.science/r/TAPS-EMNLP2026-53DD
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。