Making Every Verified Token Count: Adaptive Verification for MoE Speculative Decoding

·ArXiv cs.CL··

arXiv:2605.00342v1 Announce Type: new Abstract: Tree-based speculative decoding accelerates autoregressive generation by verifying multiple draft candidates in parallel, but this advantage weakens for sparse Mixture-of-Experts (MoE) models. As the draft tree grows, different branches activate different experts, expanding the union of activated experts and substantially increasing target-side verification cost. We propose EVICT, a training-free, hyperparameter-free, and lossless adaptive verifica...

Read full article →

Related Articles

OpenAI’s o1 correctly diagnosed 67% of ER patients vs. 50-55% by triage doctors
donsupreme · Hacker News · 5mo ago
Harvard particle physicist Matthew Schwartz drops 36 papers authored with Claude
xqcgrek2 · Hacker News · 1d ago
Accelerating Gemma 4: faster inference with multi-token prediction drafters
amrrs · Hacker News · 5mo ago
An AI agent emailed researchers for help. It told us why
sbulaev · Hacker News · 9h ago
A couple million lines of Haskell: Production engineering at Mercury
unignorant · Hacker News · 5mo ago