arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.06706cs.CL
收藏

多候选推测解码

Multi-Candidate Speculative Decoding

National Key Laboratory for Novel Software Technology, Nanjing University(南京大学计算机软件新技术国家重点实验室)

Sen Yang, Shujian Huang, Xinyu Dai, Jiajun Chen

AI总结:

本文提出多候选推测解码方法,通过从草稿模型采样多个候选序列并批量验证,在保持目标模型分布的同时显著提升 token 接受率,一致优于标准推测解码。

摘要:

大型语言模型在众多自然语言处理任务中展现出卓越能力,但其自回归式文本生成过程耗时较长。加速生成的一种方法是推测解码,即由一个快速草稿模型生成候选片段(一个 token 序列),再由目标模型并行验证。然而,候选 token 的接受率受到模型、数据集和解码设置等多种因素的限制。本文提出从草稿模型中采样多个候选序列,并将其分批组织以进行验证。我们设计了在保持目标模型分布不变的前提下进行高效多候选验证的算法。我们的方法在多个数据集和模型上显著提升了接受率,一致优于标准推测解码。

英文摘要:

Large language models have shown impressive capabilities across a variety of NLP tasks, yet their generating text autoregressively is time-consuming. One way to speed them up is speculative decoding, which generates candidate segments (a sequence of tokens) from a fast draft model that is then verified in parallel by the target model. However, the acceptance rate of candidate tokens receives limitations from several factors, such as the model, the dataset, and the decoding setup. This paper proposes sampling multiple candidates from a draft model and then organising them in batches for verification. We design algorithms for efficient multi-candidate verification while maintaining the distribution of the target model. Our approach shows significant improvements in acceptance rates on multiple datasets and models, consistently outperforming standard speculative decoding.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑