A Simple, Fast Diverse Decoding Algorithm for Neural Generation
Jiwei Li Will Monroe Dan Jurafsky Affiliation: Computer Science Department, Stanford University, Stanford, CA, USA Email:
Abstract
We propose a simple, fast decoding algorithm that fosters diversity in neural generation. The algorithm modifies the standard beam search algorithm by penalizing hypotheses that are siblings---expansions of the same parent node in the search---thus favoring including hypotheses from diverse parents. We evaluate the model on three neural generation tasks: dialogue response generation, abstractive summarization, and machine translation. We also describe an extended model that uses reinforcement learning to automatically choose the appropriate level of beam diversity for different inputs or tasks. Simple diverse decoding helps across all three tasks, especially those needing reranking or having diverse ground truth outputs; reinforcement learning offers an additional boost. 11 1 This paper includes material from the unpublished manuscript “Mutual Information and Diverse Decoding Improve Neural Machine Translation” (Li and Jurafsky, 2016).
原文 arXiv:1611.08562;中英对照 + 大白话阅读 https://aha.fim.ai/paper/1611.08562v2