Like greedy decoding, beam search is a likelihood-maximizing decoding algorithmgiven the input sequence x, the objective is to find an output sequence y which maximizes P (y|x).
researchers have shown that for openended generation tasks (including storytelling), beam search produces repetitive, generic and degenerate text (Holtzman et al., 2019).