Greedy decoding selects the single most probable next token at each step and commits to it. A locally probable choice can lead to a worse complete sequence. section 9.3.2
Beam search keeps several candidate continuations alive and chooses the highest-scoring sequence at the end. In Self-RAG, token-guided scoring further rewards continuations judged relevant, supported, and useful. section 9.3.2















