Fine-Tuning by Curriculum Learning for Non-Autoregressive Neural Machine Translation

Junliang Guo, Xu Tan, Linli Xu, Tao Qin, Enhong Chen +1 more
11/20/2019
cs.LGstat.ML

Official code: lemmonation/fcl-nat (13 stars, MIT, last commit 2020-07-10).

Abstract

Non-autoregressive translation (NAT) models remove the dependence on previous target tokens and generate all target tokens in parallel, resulting in significant inference speedup but at the cost of inferior translation accuracy compared to autoregressive translation (AT) models. Considering that AT models have higher accuracy and are easier to train than NAT models, and both of them share the same model configurations, a natural idea to improve the accuracy of NAT models is to transfer a well-trained AT model to an NAT model through fine-tuning. However, since AT and NAT models differ greatly in training strategy, straightforward fine-tuning does not work well. In this work, we introduce curriculum learning into fine-tuning for NAT. Specifically, we design a curriculum in the fine-tuning process to progressively switch the training from autoregressive generation to non-autoregressive generation. Experiments on four benchmark translation datasets show that the proposed method achieves good improvement (more than $1$ BLEU score) over previous NAT baselines in terms of translation accuracy, and greatly speed up (more than $10$ times) the inference process over AT baselines.

View on arXivView PDF

Code Implementations(1)

MIT

Code for "Fine-Tuning by Curriculum Learning for Non-Autoregressive Neural Machine Translation"

131Shell, PythonNov 21, 20196 years agoMIT

Cite this paper

@article{guo2019finetuning,
  title  = {Fine-Tuning by Curriculum Learning for Non-Autoregressive Neural Machine Translation},
  author = {Junliang Guo and Xu Tan and Linli Xu and Tao Qin and Enhong Chen and Tie-Yan Liu},
  year   = {2019},
  eprint = {1911.08717},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1911.08717}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1911.08717.svg)](https://codeofpaper.com/paper/1911.08717)

Discussion