Greedy Decoding
Greedy decoding is a text generation strategy in which a language model selects the single highest-probability token at each generation step, without considering how that choice affects the probability of future tokens in the sequence.
4 resources across 1 library
Glossary Terms(4)
N-gram Model
An n-gram model is a probabilistic language model that predicts or represents text based on sequences of n consecutive words (or characters), estimating the pr…
Greedy Decoding
Greedy decoding is a text generation strategy in which a language model selects the single highest-probability token at each generation step, without consideri…
Top-K Sampling
Top-k sampling is a text generation strategy in which a language model restricts its choice of next token to the k highest-probability candidates at each step,…
Self-Consistency Prompting
Self-consistency prompting is a prompting technique that generates multiple independent reasoning paths for the same question, typically using chain-of-thought…