Sampling only from the smallest set of tokens whose probabilities reach p.
No comparable attributes have been recorded for these two technologies yet.
Generated from the differences above by structured rules, not by a model.
Choose Top-p Sampling if…
Nothing in the recorded attributes distinguishes it in your favour.
Choose Beam Search if…
Nothing in the recorded attributes distinguishes it in your favour.
The page is kept reachable but excluded from search indexes until it carries enough sourced detail (PRD SEO-08).
technique · Techniques
Top-p, or nucleus sampling, keeps the most likely tokens until their cumulative probability reaches a threshold, then samples from that set. It solves the problem that a fixed top-k includes nonsense when the distribution is peaked and excludes reasonable options when it is flat. It exists because the set of plausible continuations should be sized by the model's own confidence.
technique · Techniques
Beam search expands several partial sequences at once and keeps the highest-scoring ones, rather than committing to the token chosen at each step. It solves the problem that greedy decoding can be locally optimal and globally poor. It exists as the default for translation and summarisation, and it tends to produce bland text for open-ended generation.
