Beam Search

A decoding algorithm that explores multiple possible output sequences simultaneously, keeping the most promising candidates at each step rather than committing to a single path. It strikes a balance between the speed of greedy decoding and the thoroughness of exhaustive search, producing higher quality outputs than always picking the single most likely next token.
See also: autoregressive model, large language model.