RenewNAT: Renewing Potential Translation for Non-Autoregressive Transformer

Pei Guo, Yisheng Xiao, Juntao Li, Min Zhang
3/14/2023
cs.CL

No confident code implementation found for this paper.

Abstract

Non-autoregressive neural machine translation (NAT) models are proposed to accelerate the inference process while maintaining relatively high performance. However, existing NAT models are difficult to achieve the desired efficiency-quality trade-off. For one thing, fully NAT models with efficient inference perform inferior to their autoregressive counterparts. For another, iterative NAT models can, though, achieve comparable performance while diminishing the advantage of speed. In this paper, we propose RenewNAT, a flexible framework with high efficiency and effectiveness, to incorporate the merits of fully and iterative NAT models. RenewNAT first generates the potential translation results and then renews them in a single pass. It can achieve significant performance improvements at the same expense as traditional NAT models (without introducing additional model parameters and decoding latency). Experimental results on various translation benchmarks (e.g., \textbf{4} WMT) show that our framework consistently improves the performance of strong fully NAT methods (e.g., GLAT and DSLP) without additional speed overhead.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{guo2023renewnat,
  title  = {RenewNAT: Renewing Potential Translation for Non-Autoregressive Transformer},
  author = {Pei Guo and Yisheng Xiao and Juntao Li and Min Zhang},
  year   = {2023},
  eprint = {2303.07665},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.07665v1}
}

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/2303.07665.svg)](https://codeofpaper.com/paper/2303.07665)

Discussion