mlsanityData to 7 Oct 2026

Reward Optimization for Neural Machine Translation with Learned Metrics

arXiv 2104.07541 ↗First posted 15 Apr 2021cs.CL cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

Neural machine translation (NMT) models are conventionally trained with token-level negative log-likelihood (NLL), which does not guarantee that the generated translations will be optimized for a selected sequence-level evaluation metric. Multiple approaches are proposed to train NMT with BLEU as the reward, in order to directly improve the metric. However, it was reported that the gain in BLEU does not translate to real quality improvement, limiting the application in industry. Recently, it became clear to the community that BLEU has a low correlation with human judgment when dealing with state-of-the-art models. This leads to the emerging of model-based evaluation metrics. These new metrics are shown to have a much higher human correlation. In this paper, we investigate whether it is beneficial to optimize NMT models with the state-of-the-art model-based metric, BLEURT. We propose a contrastive-margin loss for fast and stable reward optimization suitable for large NMT models. In experiments, we perform automatic and human evaluations to compare models trained with smoothed BLEU and BLEURT to the baseline models. Results show that the reward optimization with BLEURT is able to increase the metric scores by a large margin, in contrast to limited gain when training with smoothed BLEU. The human evaluation shows that models trained with BLEURT improve adequacy and coverage of translations. Code is available via https://github.com/naver-ai/MetricMT.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 25 of its 49 references that are in the map. First posted on arXiv 15 Apr 2021.

Builds on

25 of 49 references.

References · 25

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2019BERTScore: Evaluating Text Generation with BERTcited by 5,462
  4. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  5. 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
  6. 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,471
  7. 2020BLEURT: Learning Robust Metrics for Text Generationcited by 1,196
  8. 2015Sequence Level Training with Recurrent Neural Networkscited by 568
  9. 2018Meta-learning with differentiable closed-form solverscited by 395
  10. 2018Scaling Neural Machine Translationcited by 204
  11. 2016Enhanced LSTM for Natural Language Inferencecited by 199
  12. 2020Tangled up in BLEU: Reevaluating the Evaluation of Automatic Machine Translation Evaluation Metricscited by 155
13 more
  1. 2016Sequence-to-Sequence Learning as Beam-Search Optimizationcited by 126
  2. 2015Minimum Risk Training for Neural Machine Translationcited by 114
  3. 2019Beyond BLEU: Training Neural Machine Translation with Semantic Similaritycited by 84
  4. 2019On the Weaknesses of Reinforcement Learning for Neural Machine Translationcited by 82
  5. 2020A Generic First-Order Algorithmic Framework for Bi-Level Programming Beyond Lower-Level Singletoncited by 78
  6. 2018A Study of Reinforcement Learning for Neural Machine Translationcited by 74
  7. 2018NSML: Meet the MLaaS platform with a real-world case studycited by 70
  8. 2017Classical Structured Prediction Losses for Sequence to Sequence Learningcited by 55
  9. 2020Convergence Properties of Stochastic Hypergradientscited by 19
  10. 2019Distilling Knowledge Learned in BERT for Text Generationcited by 5
  11. 2020BERT as a Teacher: Contextual Embeddings for Sequence-Level Rewardcited by 5
  12. 2020MLE-guided parameter search for task loss minimization in neural sequence modelingcited by 4
  13. 2020Single-level Optimization For Differential Architecture Searchcited by 2

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 2; 2023: 3; 2024: 2; 2025: 3.

12 papers.