Beam Search Decoding

Beam search randomly samples tokens, while greedy decoding always picks the most probable token Beam search explores multiple candidate sequences in parallel by keeping the top-k hypotheses at each decoding step Beam search is faster than greedy decoding because it prunes the search space Beam search and greedy decoding always produce identical outputs