Revisiting the Weaknesses of Reinforcement Learning for Neural Machine Translation

By Samuel Kiegeland, Julia Kreutzer. 2021

51 citations recorded by the source corpus.

Policy gradient algorithms have found wide adoption in NLP, but have recently become subject to criticism, doubting their suitability for NMT. Choshen et al. (2020) identify multiple weaknesses and suspect that their success is determined by the shape of output distributions rather than the reward. In this paper, we revisit these claims and study them under a wider range of configurations. Our experiments on in-domain and cross-domain adaptation reveal the importance of exploration and reward scaling, and provide empirical counter-evidence to these claims.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Natural Language Processing, Reinforcement Learning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Yejin Choi
  2. Mohit Bansal
  3. Hannaneh Hajishirzi
  4. Percy Liang
  5. Luke S. Zettlemoyer
  6. Jianfeng Gao
  7. Noah A. Smith
  8. Caiming Xiong

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Yejin Choi
  3. Dacheng Tao
  4. Mohit Bansal
  5. Trevor Darrell
  6. Hannaneh Hajishirzi
  7. Bernt Schiele
  8. Li Fei-Fei

In Natural Language Processing

  1. Yejin Choi
  2. Mohit Bansal
  3. Percy Liang
  4. Hannaneh Hajishirzi
  5. Noah A. Smith
  6. Luke S. Zettlemoyer
  7. Jianfeng Gao
  8. Jonathan Berant

In Reinforcement Learning

  1. Germán Kruszewski
  2. Tomasz Korbak
  3. Hady ElSahar
  4. Hannaneh Hajishirzi
  5. Yejin Choi
  6. Marc Dymetman
  7. Kianté Brantley
  8. Percy Liang

Citations in the corpus