Keywords: machine translation, non-autoregressive, transformer, fertility, nmt
TL;DR: We introduce the first NMT model with fully parallel decoding, reducing inference latency by 10x.
Abstract: Existing approaches to neural machine translation condition each output word on previously generated outputs. We introduce a model that avoids this autoregressive property and produces its outputs in parallel, allowing an order of magnitude lower latency during inference. Through knowledge distillation, the use of input token fertilities as a latent variable, and policy gradient fine-tuning, we achieve this at a cost of as little as 2.0 BLEU points relative to the autoregressive Transformer network used as a teacher. We demonstrate substantial cumulative improvements associated with each of the three aspects of our training strategy, and validate our approach on IWSLT 2016 English–German and two WMT language pairs. By sampling fertilities in parallel at inference time, our non-autoregressive model achieves near-state-of-the-art performance of 29.8 BLEU on WMT 2016 English–Romanian.
Code: [![github](/images/github_icon.svg) salesforce/nonauto-nmt](https://github.com/salesforce/nonauto-nmt) + [![Papers with Code](/images/pwc_icon.svg) 1 community implementation](https://paperswithcode.com/paper/?openreview=B1l8BtlCb)
Data: [WMT 2014](https://paperswithcode.com/dataset/wmt-2014), [WMT 2016](https://paperswithcode.com/dataset/wmt-2016), [WMT 2016 News](https://paperswithcode.com/dataset/wmt-2016-news)