Question 3
Suppose we use a pre-trained model for text generation with the given prompt “I am going to”. Which of the following decoding strategies can be used such that the pre-trained model generates different text completion each time it is executed
Beam search with beam size 1
Greedy approach
Top-K with k = 2
None of these