[KongchangAI]
Conceptgreedy decoding / greedy search

Greedy Decoding

An inference strategy for language models in which the token with the highest probability is selected at each generation step. It corresponds to sampling with temperature set to zero and theoretically produces deterministic outputs.

Core Facts

Timeline (last 90 days)

Oct 16

Greedy decoding is extremely prone to falling into degenerate loops on low-bit quantized models, because weight quantization loses a large amount of numerical precision and the model's scores for certain token sequences exhibit pathologically high peaks, causing the same passage of text to be output repeatedly.

Unverified50%
Aug 25

Greedy decoding always selects the token with the highest probability, while random sampling draws from the probability distribution, which means the same prompt may yield different responses.

Unverified60%

All Facts (4)

Source Articles