UBTree brings near-7x LLM decoding speedups
Inclusion AI’s UBTree pairs a parallel unigram proposer with a lightweight bigram selector to build diverse draft trees for speculative decoding. Its paper reports 5.84–6.94x average speedups on Qwen3-4B and Qwen3-8B without changing the target model or output distribution.
UBTree is a compelling inference advance, but its near-7x headline remains benchmark-dependent rather than a guaranteed production multiplier.
- –Parallel candidate generation and bigram transition scoring reduce draft-tree construction overhead.
- –Tree-native renormalized-KL training preserves plausible alternative branches instead of optimizing only the greedy path.
- –Production-scale tests report roughly 4.8–5.4x speedups on Ling3-Flash and Qwen3.8-27B.
- –Developers still need a matching target model, draft checkpoint, and inference-engine integration; UBTree is not a standalone LLM.
- –The strongest comparisons rely on limited single-run benchmark subsets, so independent replication matters.
DISCOVERED
1h ago
2026-10-30
PUBLISHED
1h ago
2026-10-30
RELEVANCE
AUTHOR
cutetoxicguy