arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.03249cs.CLcs.LGstat.ML
收藏

插入Transformer:通过插入操作的灵活序列生成

Insertion Transformer: Flexible Sequence Generation via Insertion Operations

Google Brain(谷歌大脑);University of California, Berkeley(加州大学伯克利分校)

Mitchell Stern, William Chan, Jamie Kiros, Jakob Uszkoreit

摘要:

我们提出了插入Transformer,一个迭代的,部分自回归模型的序列生成的基础上插入操作。与典型的自回归模型依赖于一个固定的,往往是从左到右的输出排序,我们的方法通过允许令牌在解码过程中插入序列中的任何地方,以适应任意的排序。这种灵活性带来了许多优点:例如,我们的模型不仅可以被训练为遵循特定的顺序,例如从左到右生成或二叉树遍历,而且还可以被训练为在所有有效插入上最大化熵以实现鲁棒性。此外,我们的模型无缝地适应完全自回归生成(一次插入一个)和部分自回归生成(在多个位置同时插入)。我们通过分析WMT 2014英语-德语机器翻译任务在各种训练和解码设置下的性能来验证我们的方法。我们发现,插入Transformer优于许多以前的非自回归方法,翻译在可比或更好的水平的并行性,并成功地恢复了原来的Transformer的性能,同时只需要在解码过程中的多次迭代。

英文摘要:

We present the Insertion Transformer, an iterative, partially autoregressive model for sequence generation based on insertion operations. Unlike typical autoregressive models which rely on a fixed, often left-to-right ordering of the output, our approach accommodates arbitrary orderings by allowing for tokens to be inserted anywhere in the sequence during decoding. This flexibility confers a number of advantages: for instance, not only can our model be trained to follow specific orderings such as left-to-right generation or a binary tree traversal, but it can also be trained to maximize entropy over all valid insertions for robustness. In addition, our model seamlessly accommodates both fully autoregressive generation (one insertion at a time) and partially autoregressive generation (simultaneous insertions at multiple locations). We validate our approach by analyzing its performance on the WMT 2014 English-German machine translation task under various settings for training and decoding. We find that the Insertion Transformer outperforms many prior non-autoregressive approaches to translation at comparable or better levels of parallelism, and successfully recovers the performance of the original Transformer while requiring only logarithmically many iterations during decoding.

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

↑