Improving Multi-candidate Speculative Decoding
<|reference_start|>Improving Multi-candidate Speculative Decoding: Speculative Decoding (SD) is a technique to accelerate the inference of Large Language Models (LLMs) by using a lower complexity draft model to propose candidate tokens verified by a larger target model. To further improve efficiency, Multi-Candidate Speculative Decoding (MCSD) improves upon this by sampling multiple candidate tokens from the draft model at each step and verifying them in parallel, thus increasing the chances of accepting a token and reducing generation time. Existing MCSD methods rely on the draft model to initialize the multi-candidate sequences and use static length and tree attention structure for draft generation. However, such an approach suffers from the draft and target model's output distribution differences, especially in dynamic generation context. In this work, we introduce an improved version of MCSD that includes a target model initialized multi-candidate process, dynamic sliced topology-aware causal mask for dynamic length adjustment, and decision models to optimize early stopping. Our framework improves the acceptance rate, defined as the ratio of the longest draft sequence length accepted by the target model over the maximum draft sequence length, by a maximum of 164% and gains a maximum of 75% generation speed up over the MCSD baseline. We also conduct an ablation study to evaluate the impact of the decision model.<|reference_end|>
@article{lu2024improving,
    title={Improving Multi-candidate Speculative Decoding},
    author={Xiaofan Lu, Yixiao Zeng, Feiyang Ma, Zixu Yu, Marco Levorato},
    journal={arXiv preprint arXiv:2409.10644},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.10644},
    primaryClass={cs.CL}
}