Beam Search
Keeping several candidate sequences alive and extending the best.
Aperçu
Beam search expands several partial sequences at once and keeps the highest-scoring ones, rather than committing to the token chosen at each step. It solves the problem that greedy decoding can be locally optimal and globally poor. It exists as the default for translation and summarisation, and it tends to produce bland text for open-ended generation.
Graphe des technologies
Comment Beam Search se rattache au reste de la pile.
Alternatives
-
Top-p Sampling
technique
Une alternative à Beam Search · source
Comparaisons
Comparaisons détaillées avec les alternatives ci-dessus.