Determinantal Beam Search

Understand

Beam search is a go-to strategy for decoding neural sequence models.

• The algorithm can naturally be viewed as a subset optimization problem, albeit one where the corresponding set function does not reflect interactions between candidates.
• Empirically, this leads to sets often exhibiting high overlap, e.g., strings may differ by only a single word.
• Yet in use-cases that call for multiple solutions, a diverse or representative set is often desired.