International Conference on Learning Representations · 2020 · 130 citations · 17 references
ComputingComputer ScienceComputational LinguisticsMachine LearningNatural Language ProcessingLanguage ModelingLanguage ModelsNatural Language GenerationText GenerationAutomated Text GenerationGreedy HeuristicsSequence GenerationTraining
Neural text generation is widely used, yet standard likelihood training and decoding produce dull, repetitive outputs because the model assigns high probability to frequent words and repeated sequences, and post‑hoc fixes such as top‑k or nucleus sampling do not correct these underlying probability errors. This study demonstrates that the likelihood objective itself is responsible for these issues and introduces unlikelihood training to penalize unlikely generations. Unlikelihood training assigns lower probability to unlikely tokens and sequences, applied at both token‑ and sequence‑levels to reshape the model’s probability distribution. The resulting models generate less repetitive, less dull text while preserving perplexity, outperforming nucleus sampling and beam blocking in human evaluations and yielding superior outputs with greedy or beam search.
Neural text generation is a key tool in natural language applications, but it is well known there are major problems at its core. In particular, standard likelihood training and decoding leads to dull and repetitive outputs. While some post-hoc fixes have been proposed, in particular top-k and nucleus sampling, they do not address the fact that the token-level probabilities predicted by the model are poor. In this paper we show that the likelihood objective itself is at fault, resulting in a model that assigns too much probability to sequences containing repeats and frequent words, unlike those from the human training distribution. We propose a new objective, unlikelihood training, which forces unlikely generations to be assigned lower probability by the model. We show that both token and sequence level unlikelihood training give less repetitive, less dull text while maintaining perplexity, giving superior generations using standard greedy or beam search. According to human evaluations, our approach with standard beam search also outperforms the currently popular decoding methods of nucleus sampling or beam blocking, thus providing a strong alternative to existing techniques.
17
fairseq: A Fast, Extensible Toolkit for Sequence Modeling
Myle Ott, Sergey Edunov, Alexei Baevski et al. · 2019 · 2.5K citations · Full text
Discriminative training methods for hidden Markov models
Michael Collins · 2002 · 1.9K citations · Full text