3) Top-p (Nucleus) Sampling: Sampling from the smallest vocabulary subset V (p) ⊂ V such that it takes up the most probable tokens whose cumulative probability mass exceeds p, 0 < p < 1. Fixed k can be suboptimal across different distributions, while a top-p% subset is dynamic and for high values of p covers the majority of the probability mass.