greedy decoding

greedy decoding

/ˌɡriːdi dɪˈkoʊdɪŋ/

LLM Inference

always selecting the highest probability token at each step

Greedy decoding is fast but may miss better overall sequences.

Origin: Old English grǣdig voracious + Latin decodare to decipher