When Does Better Acceptance Pay? A Controlled Study of Speculative Decoding
The throughput gains of speculative decoding depend on the trade-off between acceptance length and execution latency. We ask when additional acceptance is worth the cost of obtaining it. We establish a comparison protocol spanning training, inference, and evaluation, remeasuring released checkpoints and retraining six drafter recipes on shared target-generated data across ten benchmarks and two target models. Alignment changes the picture: gaps that appear large in published comparisons shrink substantially under shared training and inference conditions. This narrowing motivates two deeper questions: how is acceptance improved at different costs, and when do these gains improve throughput...
| Authors | Yongchao Long, Chunrui Zheng, Yuxuan Zhou et al. |
|---|---|
| Primary category | cs.CL |
| Published | 18 October 2026 |
| Last updated at source | 18 October 2026 |
Models and datasets referencing this paper
- ernie-research/DCore-DFlash-Qwen3-8B-Budget8Model
- ernie-research/DCore-DPace-Qwen3-8B-Budget8Model
- ernie-research/DCore-Qwen3-8B-Budget16Model
- ernie-research/DCore-Domino-Qwen3-8B-Budget8Model
- ernie-research/DCore-EAGLE3-Qwen3-8BModel
- ernie-research/DCore-DSpark-Qwen3-8B-Budget8Model
- ernie-research/DCore-DFlare-Qwen3-8B-Budget8Model
- ernie-research/DCore-DFlare-Qwen3-8B-Budget16Model
Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 20 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.