mlsanityData to 7 Oct 2026

Differentiable Scheduled Sampling for Credit Assignment

arXiv 1704.06970 ↗First posted 23 Apr 2017cs.CL cs.LG cs.NEcited by 13

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 23 Apr 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2020: 1; 2021: 6; 2022: 2; 2023: 2; 2024: 2.

13 papers.

Sort:

By area: