Top KSampling
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, then randomly samples from that reduced set according to their relative probabilities.
3 resources across 1 library
Glossary Terms(3)
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…