Question 15
Which of the following statements about beam search is/are incorrect ?
Beam search balances exploration and exploitation by considering multiple sequences at each step.
A larger beam width increases computational cost but improves search quality.
Greedy search is equivalent to beam search with beam size B = 1.
Unlike greedy search, beam search guarantees finding the globally optimal sequence.