Go to ACL ARR 2025 February homepageTETRIS: Optimal Draft Token Selection for Batch Speculative Decoding
We propose Tetris, a novel method that optimizes the $\textit{total throughput}$ of batch speculative decoding in multi-request settings. Unlike existing methods that optimize for a single request or a group of requests as a whole, Tetris actively selects the most promising draft tokens (for every request in a batch) to be accepted when verified in parallel, resulting in fewer rejected tokens and hence less wasted computing resources. Such an effective resource utilization to achieve fast inference in large language models (LLMs) is especially important to service providers with limited inference capacity. Compared to baseline speculative decoding, Tetris yields a consistently higher acceptance rate and more effective utilization of the limited inference capacity. We show theoretically and empirically that Tetris outperforms baseline speculative decoding and existing methods that dynamically select draft tokens, leading to a more efficient batch inference in LLMs.