Greedy Decoding

Greedy decoding selects the single highest-probability token at every generation step. It is the simplest and fastest decoding strategy and is fully deterministic given the same input. However, locally optimal token choices do not always lead to globally optimal sequences: a sequence that starts with a slightly lower-probability token may yield a far higher total-sequence probability. For tasks where exact accuracy matters more than fluency or diversity, greedy decoding is often a sensible baseline.