mirror of
https://github.com/ggml-org/llama.cpp.git
synced 2026-07-02 01:00:20 +00:00
217469f07f
In addition to match the algorithm proposed in the original [paper](https://arxiv.org/abs/1904.09751), this resolves the edge-case where `max_p is > top_p` for a single logit, where the mask would otherwise be empty (and we thus sample from the whole vocabulary with equal likelihood)