| Challenge: | Existing non-autoregressive machine translation methods are lacking in the field of latent alignments. |
| Approach: | They propose two strong methods for non-autoregressive machine translation that model latent alignments with dynamic programming. |
| Outcome: | The proposed models achieve state-of-the-art on the WMT’14 EnDe task, compared with the autoregressive Transformer baseline. |
Similar Papers
Can Latent Alignments Improve Autoregressive Machine Translation? (2021.naacl-main)
Copied to clipboard
| Challenge: | Latent alignment objectives improve non-autoregressive models, but can they improve autoregressive ones? e.g., we show that latent alignments are incompatible with teacher forcing. |
| Approach: | They propose latent alignment objectives that use a dynamic program to comb the space of monotonic alignments between the "gold" target sequence and token probabilities the model predicts. |
| Outcome: | The proposed models are incompatible with teacher forcing, the authors show . they show that latent alignment objectives reduce misalignments and focus on original error . |
Non-Autoregressive Neural Machine Translation: A Call for Clarity (2022.emnlp-main)
Copied to clipboard
| Challenge: | Non-autoregressive translation models require a single forward pass to generate the output sequence instead of iteratively producing each predicted token. |
| Approach: | They propose to use a single forward pass to generate the output sequence instead of iteratively producing each predicted token. |
| Outcome: | The proposed models improve translation quality and speed under third-party testing environments. |
Non-Autoregressive Translation by Learning Target Categorical Codes (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing non-autoregressive text generation models still fall behind in translation quality . authors propose a model that learns implicitly categorical codes as latent variables . |
| Approach: | They propose a non-autoregressive Transformer model that implicitly categorizes latent variables into decoding . they find it improves translation quality by introducing more informative decoder inputs . |
| Outcome: | The proposed model achieves comparable or better performance in machine translation tasks than strong baselines. |
Fully Non-autoregressive Neural Machine Translation: Tricks of the Trade (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing non-autoregressive neural machine translation models are slow to learn the dependency between output tokens. |
| Approach: | They propose to use fully non-autoregressive neural machine translation (NAT) to predict tokens with single forward of neural networks. |
| Outcome: | The proposed model achieves state-of-the-art results on three translation benchmarks with comparable performance to autoregressive and iterative NAT systems. |
Enriching Non-Autoregressive Transformer with Syntactic and Semantic Structures for Neural Machine Translation (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing non-autoregressive models have boosted the efficiency of neural machine translation, but their performance is significantly worse than that of autoregressive counterparts. |
| Approach: | They propose to incorporate syntactic and semantic structures among natural languages into a non-autoregressive Transformer for the task of neural machine translation. |
| Outcome: | The proposed model achieves faster speed and keeps translation quality compared with other models. |
AligNART: Non-autoregressive Neural Machine Translation by Jointly Learning to Estimate Alignment and Translate (2021.emnlp-main)
Copied to clipboard
| Challenge: | Non-autoregressive neural machine translation models suffer from the multi-modality problem . aligNART leverages full alignment information to explicitly reduce the modality of the target distribution . |
| Approach: | They propose an alignment decomposition method which explicitly reduces the modality of the target distribution. |
| Outcome: | The proposed model outperforms previous models that focus on modality reduction on two translation tasks. |
What Have We Achieved on Non-autoregressive Translation? (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing studies have shown that non-autoregressive (NAT) methods underperform autoregressive methods (AT) however, their evaluation using BLEU has been shown to weakly correlate with human annotations. |
| Approach: | They propose to evaluate four representative NAT methods using BLEU to narrow the performance gap between autoregressive and autoregressive translations. |
| Outcome: | The proposed methods underperform NAT and autoregressive methods under more reliable evaluation metrics. |
Align-Refine: Non-Autoregressive Speech Recognition via Iterative Realignment (2021.naacl-main)
Copied to clipboard
| Challenge: | Non-autoregressive encoder-decoder models improve decoding speed, but generation quality suffers . editing at the level of output sequences limits model flexibility. |
| Approach: | They propose *iterative realignment* which iteratively realigns connectionist temporal alignments. |
| Outcome: | The proposed model matches an autoregressive baseline with a 14x speedup on the WSJ dataset; on LibriSpeech, it achieves an LM-free test-other WER of 9.0% (19% relative improvement on comparable work). |
Non-Autoregressive Document-Level Machine Translation (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing non-autoregressive translation models struggle with document context and handling discourse phenomena. |
| Approach: | They propose a simple but effective design of sentence alignment between source and target to improve their performance on document-level machine translation. |
| Outcome: | The proposed model achieves high acceleration on documents and sentence alignment significantly enhances their performance. |
Train Once, and Decode As You Like (2020.coling-main)
Copied to clipboard
| Challenge: | Existing approaches to machine translation support autoregressive, semi-autoregressive and refinement-based non-auto-regressives. |
| Approach: | They propose a unified approach for supporting different generation manners of machine translation including autoregressive, semi-autoregressive and refinement-based non-auto-regressives. |
| Outcome: | The proposed approach achieves better or competitive translation performance compared with strong baseline models in all the settings. |