arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.08148eess.AScs.SD
收藏

基于多Token预测的Speech-LLaMA快速推理方法

Faster Speech-LLaMA Inference with Multi-token Prediction

Meta

Desh Raj, Gil Keren, Junteng Jia, Jay Mahadeokar, Ozlem Kalinli

AI总结:

针对Speech-LLaMA自回归推理耗时长的问题,研究提出多token预测加速方法,搭配多种架构、推理策略与前缀束搜索解码,实现解码器调用减少约3.2倍且WER性能不降反升。

摘要:

大语言模型(LLM)已能熟练处理各类任务,包括多模态输入相关任务。具体而言,为LLaMA这类大语言模型搭配语音编码器,并在配对数据上训练,可让仅含解码器的模型获得语音识别(ASR)能力,这类模型被称为Speech-LLaMA。但由于自回归推理的序列特性,且解码器规模相对较大,Speech-LLaMA模型的推理耗时较长。\n本研究提出在同一解码步骤中预测多个token,以此加快Speech-LLaMA的推理速度。我们探索了可实现该功能的多种模型架构,并基于阈值策略和验证策略的推理方案研究了其性能。我们还提出一种基于前缀的束搜索解码方法,可为此类模型实现高效的最低词错误率(MWER)训练。我们在多个公开基准上对模型进行评估,结果显示,模型将解码器调用次数减少了约3.2倍,同时保持甚至提升了词错误率(WER)性能。

英文摘要:

Large language models (LLMs) have become proficient at solving a wide variety of tasks, including those involving multi-modal inputs. In particular, instantiating an LLM (such as LLaMA) with a speech encoder and training it on paired data imparts speech recognition (ASR) abilities to the decoder-only model, hence called Speech-LLaMA. Nevertheless, due to the sequential nature of auto-regressive inference and the relatively large decoder, Speech-LLaMA models require relatively high inference time. In this work, we propose to speed up Speech-LLaMA inference by predicting multiple tokens in the same decoding step. We explore several model architectures that enable this, and investigate their performance using threshold-based and verification-based inference strategies. We also propose a prefix-based beam search decoding method that allows efficient minimum word error rate (MWER) training for such models. We evaluate our models on a variety of public benchmarks, where they reduce the number of decoder calls by ~3.2x while maintaining or improving WER performance.

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

↑