Differentiable Scheduled Sampling for Credit Assignment

By Kartik Goyal, Chris Dyer, Taylor Berg-Kirkpatrick. 2017

40 citations recorded by the source corpus.

We demonstrate that a continuous relaxation of the argmax operation can be used to create a differentiable approximation to greedy decoding in sequence-to-sequence (seq2seq) models. By incorporating this approximation into the scheduled sampling training procedure–a well-known technique for correcting exposure bias–we introduce a new training objective that is continuous and differentiable everywhere and can provide informative gradients near points where previous decoding decisions change their value. By using a related approximation, we also demonstrate a similar approach to sampled-based training. We show that our approach outperforms both standard cross-entropy training and scheduled sampling procedures in two sequence prediction tasks: named entity recognition and machine translation.

Subfields: Artificial Intelligence, Political Science and International Relations, Reinforcement Learning, Optimization & Training

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. Hannaneh Hajishirzi
  3. Mohit Bansal
  4. Noah A. Smith
  5. Luke S. Zettlemoyer
  6. Jianfeng Gao
  7. Tommi S. Jaakkola
  8. Percy Liang

In Political Science and International Relations

  1. Trevor Cohn
  2. Xing Niu
  3. André F. T. Martins
  4. Yejin Choi
  5. Ion Androutsopoulos
  6. Gholamreza Haffari
  7. Jack Hessel
  8. Marine Carpuat

In Reinforcement Learning

  1. Prithviraj Ammanabrolu
  2. Hannaneh Hajishirzi
  3. Yejin Choi
  4. Tao Lei
  5. Andrea Madotto
  6. Kianté Brantley
  7. Trevor Cohn
  8. Xing Niu

In Optimization & Training

  1. Kianté Brantley
  2. Trevor Cohn
  3. Dan Su
  4. Xing Niu
  5. André F. T. Martins
  6. Christian Bauckhage
  7. Yejin Choi
  8. Regina Barzilay

Citations in the corpus