arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.04589cs.LGcs.CLstat.ML
收藏

更快的Transformer解码:N-gram掩码自注意力

Faster Transformer Decoding: N-gram Masked Self-Attention

Google, Inc.(谷歌公司)

Ciprian Chelba, Mia Chen, Ankur Bapna, Noam Shazeer

AI总结:

针对Transformer解码加速问题,提出基于N-gram假设截断目标侧自注意力窗口的方法,在WMT数据集上几乎不损失BLEU分数。

摘要:

基于预测目标词元的相关信息大多源自源句$S=s_1, \ldots, s_S$这一事实,我们提出通过做$N$-gram假设来截断用于计算自注意力的目标侧窗口。在WMT EnDe和EnFr数据集上的实验表明,当$N$值在$4, \ldots, 8$范围内时,$N$-gram掩码自注意力模型的BLEU分数损失极小,具体取决于任务。

英文摘要:

Motivated by the fact that most of the information relevant to the prediction of target tokens is drawn from the source sentence $S=s_1, \ldots, s_S$, we propose truncating the target-side window used for computing self-attention by making an $N$-gram assumption. Experiments on WMT EnDe and EnFr data sets show that the $N$-gram masked self-attention model loses very little in BLEU score for $N$ values in the range $4, \ldots, 8$, depending on the task.

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

↑