English

Differentiable Scheduled Sampling for Credit Assignment

Computation and Language 2017-04-25 v1 Machine Learning Neural and Evolutionary Computing

Abstract

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

Keywords

Cite

@article{arxiv.1704.06970,
  title  = {Differentiable Scheduled Sampling for Credit Assignment},
  author = {Kartik Goyal and Chris Dyer and Taylor Berg-Kirkpatrick},
  journal= {arXiv preprint arXiv:1704.06970},
  year   = {2017}
}

Comments

Accepted at ACL2017 (http://bit.ly/2oj1muX)

R2 v1 2026-06-22T19:25:03.699Z