Greedy decoding is a generation strategy where the model always selects the single most probable next token. It is deterministic but can lead to repetitive text.
Simplest form of decoding.
Used when deterministic output is required (e.g., math, code).