Skip to content
ai

Beam search

Beam Search Decoding

Definition

Beam search is a decoding algorithm that maintains a fixed number (beam width) of the most likely partial sequences at each generation step, expanding and pruning them to find a high-probability complete sequence. It produces more coherent outputs than greedy decoding but is slower and can generate repetitive or generic text at high beam widths.

Can this ship? Are we exposed? Can you prove it?

Every CISO is asking these three questions. We answer them with facts, not guesses, from repository to runtime.