Decoding Strategies

3 selectedDifficulty 3-53 unseenView topic

Saved practice

Keep this quiz in your learner record

Answers count toward your profile, review queue, and next-topic suggestions. You can also use the quick practice below.

FoundationNew

0 answered

2 foundation1 intermediateAdapts to your performance

Question 1 of 3

120sfoundation (3/10)compare

Greedy decoding picks the highest-probability next token at each step; beam search keeps the top- k hypotheses. When does beam search beat greedy?