RheoSampling: Resolving the One-Hot Dilemma in Stochastic Dynamic-Tree Speculative Decoding

📅 2026-09-18
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
本文提出RheoSampling方法,通过解耦树构建与验证概率,解决动态树推测解码中因随机抽样导致接受率下降的问题。
📝 Abstract
Speculative decoding accelerates LLM inference by drafting multiple tokens in parallel, with tree-based methods further improving efficiency through hierarchical structures. Dynamic-tree methods such as EAGLE-3 perform well under greedy decoding via deterministic top-K expansion and global pruning. However, in stochastic decoding (T>0), this mechanism collapses the draft distribution into one-hot probabilities, causing a severe drop in acceptance rate. This creates a dilemma: dynamic-tree methods sacrifice stochastic sampling to preserve context-aware topology, while static-tree methods preserve stochastic sampling with context-agnostic structures. The issue arises because the same probability distribution is used for two conflicting tasks: constructing the tree and verifying tokens. This coupling makes direct injection of randomness challenging due to the resulting stochastic process. We resolve this by decoupling these roles: RheoSampling assigns a token sampled from the draft distribution a proxy probability for tree expansion and pruning alongside its true sampling probability for verification. Specifically, we inject a sampled token among the deterministic top-K slots and treat it with different probabilities during construction and verification, making RheoSampling the first dynamic-tree method with both context-aware top-K construction and stochastic sampling while maintaining losslessness. We establish the lossless guarantee through an equivalence-class analysis that compresses the stochastic tree space into tractable classes. An OT-based verification strategy and a sparse draft mechanism ensure that theoretical gains translate into practical efficiency. Experiments across LLMs and benchmarks demonstrate improvements in acceptance rate and speedup over state-of-the-art dynamic tree methods. This framework may provide a template for analyzing stochastic tree structures.
Problem

Research questions and friction points this paper is trying to address.

speculative decoding
stochastic decoding
dynamic-tree methods
acceptance rate
context-aware
Innovation

Methods, ideas, or system contributions that make the work stand out.

RheoSampling
stochastic decoding
dynamic-tree method
lossless guarantee
proxy probability
🔎 Similar Papers
No similar papers found.
Q
Qiao Hu
National Center for Mathematics and Interdisciplinary Sciences (NCMIS), AMSS, CAS
Yepeng Weng
Yepeng Weng
Researcher, Lenovo Research
Large Language ModelsComputer Vision
B
Bo Zhang
SKLMS and AMSS, Chinese Academy of Sciences, School of Mathematical Sciences, University of Chinese Academy of Sciences
T
Takehisa Yairi
The University of Tokyo