Beam Search

Обзор

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.

Граф технологий

Как Beam Search связана с остальным стеком.

Альтернативы

• Top-p Sampling technique

  Альтернатива для Beam Search · source

Сравнения

Подробные сопоставления с альтернативами выше.

• Top-p Sampling vs Beam Search