CLAug 13, 2024

PEARL: Parallel Speculative Decoding with Adaptive Draft Length

arXiv:2408.11850v370 citationsh-index: 7Has Code
Originality Incremental advance
AI Analysis

This work addresses a bottleneck in speeding up large language model inference for applications requiring faster text generation, though it is incremental as it builds on existing speculative decoding methods.

The paper tackles the mutual waiting problem in speculative decoding for LLM inference acceleration by proposing PEARL, a framework that parallels drafting and verification phases with adaptive draft length, achieving speed-ups of up to 4.43x over auto-regressive decoding and 1.50x over vanilla speculative decoding.

Speculative decoding (SD), where an extra draft model is employed to provide multiple draft tokens first, and then the original target model verifies these tokens in parallel, has shown great power for LLM inference acceleration. However, existing SD methods suffer from the mutual waiting problem, i.e., the target model gets stuck when the draft model is guessing tokens, and vice versa. This problem is directly incurred by the asynchronous execution of the draft model and the target model and is exacerbated due to the fixed draft length in speculative decoding. To address these challenges, we propose a conceptually simple, flexible, and general framework to boost speculative decoding, namely Parallel spEculative decoding with Adaptive dRaft Length (PEARL). Specifically, PEARL proposes pre-verify to verify the first draft token in advance during the drafting phase, and post-verify to generate more draft tokens during the verification phase. PEARL parallels the drafting phase and the verification phase via applying the two strategies, and achieves adaptive draft length for different scenarios, which effectively alleviates the mutual waiting problem. Experiments on various text generation benchmarks demonstrate the effectiveness of our PEARL, leading to a superior speed up performance up to 4.43$\times$ and 1.50$\times$, compared to auto-regressive decoding and vanilla speculative decoding, respectively. Our code is available at https://github.com/smart-lty/ParallelSpeculativeDecoding.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes