mlsanityData to 7 Oct 2026

Quality-Aware Translation Models: Efficient Generation and Quality Estimation in a Single Model

arXiv 2310.06707 ↗First posted 10 Oct 2023cs.CL cs.AIcited by 9

Not on the map. Why?

Abstract (arXiv)

Maximum-a-posteriori (MAP) decoding is the most widely used decoding strategy for neural machine translation (NMT) models. The underlying assumption is that model probability correlates well with human judgment, with better translations getting assigned a higher score by the model. However, research has shown that this assumption does not always hold, and generation quality can be improved by decoding to optimize a utility function backed by a metric or quality-estimation signal, as is done by Minimum Bayes Risk (MBR) or quality-aware decoding. The main disadvantage of these approaches is that they require an additional model to calculate the utility function during decoding, significantly increasing the computational cost. In this paper, we propose to make the NMT models themselves quality-aware by training them to estimate the quality of their own output. Using this approach for MBR decoding we can drastically reduce the size of the candidate list, resulting in a speed-up of two-orders of magnitude. When applying our method to MAP decoding we obtain quality gains similar or even superior to quality reranking approaches, but with the efficiency of single pass decoding.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 26 of its 54 references that are in the map. First posted on arXiv 10 Oct 2023.

Builds on

26 of 54 references.

References · 26

  1. 2014Sequence to Sequence Learning with Neural Networkscited by 2,974
  2. 2019The Curious Case of Neural Text Degenerationcited by 2,881
  3. 2020BLEURT: Learning Robust Metrics for Text Generationcited by 1,196
  4. 2020COMET: A Neural Framework for MT Evaluationcited by 1,024
  5. 2016Google's Multilingual Neural Machine Translation System: Enabling Zero-Shot Translationcited by 467
  6. 2021Experts, Errors, and Context: A Large-Scale Study of Human Evaluation for Machine Translationcited by 333
  7. 2020Tangled up in BLEU: Reevaluating the Evaluation of Automatic Machine Translation Evaluation Metricscited by 155
  8. 2020Is MAP Decoding All You Need? The Inadequacy of the Mode in Neural Machine Translationcited by 137
  9. 2018Analyzing Uncertainty in Neural Machine Translationcited by 126
  10. 2022Truncation Sampling as Language Model Desmoothingcited by 121
  11. 2020BLEU might be Guilty but References are not Innocentcited by 109
  12. 2021High Quality Rather than High Model Probability: Minimum Bayes Risk Decoding with Neural Metricscited by 104
14 more
  1. 2019Getting Gender Right in Neural Machine Translationcited by 98
  2. 2019Tagged Back-Translationcited by 76
  3. 2021Sampling-Based Approximations to Minimum Bayes Risk Decoding for Neural Machine Translationcited by 63
  4. 2020TransQuest: Translation Quality Estimation with Cross-lingual Transformerscited by 59
  5. 2023Epsilon Sampling Rocks: Investigating Sampling Strategies for Minimum Bayes Risk Decoding for Machine Translationcited by 57
  6. 2020Unbabel's Participation in the WMT20 Metrics Shared Taskcited by 56
  7. 2021Understanding the Properties of Minimum Bayes Risk Decoding in Neural Machine Translationcited by 56
  8. 2019OpenKiwi: An Open Source Framework for Quality Estimationcited by 49
  9. 2022Quality-Aware Decoding for Neural Machine Translationcited by 49
  10. 2020Energy-Based Reranking: Improving Neural Machine Translation Using Energy-Based Modelscited by 44
  11. 2022Identifying Weaknesses in Machine Translation Metrics Through Minimum Bayes Risk Decoding: A Case Study for COMETcited by 41
  12. 2016Domain Control for Neural Machine Translationcited by 36
  13. 2019Controlling Text Complexity in Neural Machine Translationcited by 32
  14. 2023BLEURT Has Universal Translations: An Analysis of Automatic Metrics by Minimum Risk Trainingcited by 24

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 5; 2025: 3; 2026: 1.

9 papers.