Govur University Logo
--> --> --> -->
...

Which decoding strategy prioritizes the highest probability token at each step, potentially leading to suboptimal overall sequences?



Greedy decoding is the decoding strategy that prioritizes the highest probability token at each step. In this approach, when generating text, the model chooses the single word with the highest predicted probability as the next word in the sequence. While simple and computationally efficient, this meth....

Log in to view the answer



Redundant Elements