mlsanityData to 14 Oct 2026

DePA: Improving Non-autoregressive Machine Translation with Dependency-Aware Decoder

arXiv 2203.16266 ↗First posted 30 Mar 2022cs.CLcited by 3

Not on the map. Why?

Abstract (arXiv)

Non-autoregressive machine translation (NAT) models have lower translation quality than autoregressive translation (AT) models because NAT decoders do not depend on previous target tokens in the decoder input. We propose a novel and general Dependency-Aware Decoder (DePA) to enhance target dependency modeling in the decoder of fully NAT models from two perspectives: decoder self-attention and decoder input. First, we propose an autoregressive forward-backward pre-training phase before NAT training, which enables the NAT decoder to gradually learn bidirectional target dependencies for the final NAT training. Second, we transform the decoder input from the source language representation space to the target language representation space through a novel attentive transformation process, which enables the decoder to better capture target dependencies. DePA can be applied to any fully NAT models. Extensive experiments show that DePA consistently improves highly competitive and state-of-the-art fully NAT models on widely used WMT and IWSLT benchmarks by up to 1.88 BLEU gain, while maintaining the inference latency comparable to other fully NAT models.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 28 of its 39 references that are in the map. First posted on arXiv 30 Mar 2022.

Builds on

28 of 39 references.

References · 28

  1. 2017Attention Is All You Needcited by 60,361
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2018A Call for Clarity in Reporting BLEU Scorescited by 1,799
  4. 2016Sequence-Level Knowledge Distillationcited by 801
  5. 2017Non-Autoregressive Neural Machine Translationcited by 463
  6. 2017Parallel WaveNet: Fast High-Fidelity Speech Synthesiscited by 215
  7. 2019Levenshtein Transformercited by 199
  8. 2018Deterministic Non-Autoregressive Neural Sequence Modeling by Iterative Refinementcited by 195
  9. 2019Insertion Transformer: Flexible Sequence Generation via Insertion Operationscited by 125
  10. 2018Fast Decoding in Sequence Models using Discrete Latent Variablescited by 104
  11. 2020Glancing Transformer for Non-Autoregressive Neural Machine Translationcited by 103
  12. 2020Fully Non-autoregressive Neural Machine Translation: Tricks of the Tradecited by 99
16 more
  1. 2020Non-Autoregressive Machine Translation with Latent Alignmentscited by 96
  2. 2019FlowSeq: Non-Autoregressive Conditional Sequence Generation with Generative Flowcited by 89
  3. 2018End-to-End Non-Autoregressive Neural Machine Translation with Connectionist Temporal Classificationcited by 72
  4. 2019Fast Structured Decoding for Sequence Modelscited by 59
  5. 2019Latent-Variable Non-Autoregressive Neural Machine Translation with Deterministic Inference Using a Delta Posteriorcited by 58
  6. 2019Non-Autoregressive Machine Translation with Auxiliary Regularizationcited by 52
  7. 2020On the Importance of Word and Sentence Representation Learning in Implicit Discourse Relation Classificationcited by 40
  8. 2021Non-Autoregressive Translation with Layer-Wise Prediction and Deep Supervisioncited by 40
  9. 2018Non-Autoregressive Neural Machine Translation with Enhanced Decoder Inputcited by 39
  10. 2019Fine-Tuning by Curriculum Learning for Non-Autoregressive Neural Machine Translationcited by 39
  11. 2020Incorporating BERT into Parallel Sequence Decoding with Adapterscited by 39
  12. 2019Imitation Learning for Non-Autoregressive Neural Machine Translationcited by 36
  13. 2019Masked Non-Autoregressive Image Captioningcited by 22
  14. 2018Asynchronous Bidirectional Decoding for Neural Machine Translationcited by 21
  15. 2020Learning to Recover from Multi-Modality Errors for Non-Autoregressive Neural Machine Translationcited by 19
  16. 2019Simultaneous Neural Machine Translation using Connectionist Temporal Classificationcited by 2

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 1; 2025: 1.

3 papers.