Exploitation uses evaluation results to prioritize candidate configurations expected to perform well. It favors promising candidates over less-tested alternatives, balancing the exploration that helps reveal new possibilities. section 6.2.2 section 6.5.1
In Bayesian optimization, initial random trials provide results to guide later choices. MIPROv2 first emphasizes uncertain combinations, then increasingly tests combinations likely to work well; each trial informs the next. section 6.2.2
In genetic algorithms, exploitation means selecting the strongest candidates from a pool and evaluating variations of them. Pool size matters: too few candidates can reduce diversity, while too many can include weak prompts. section 6.5.1
Prompt optimization
A Bayesian optimization trial can pair a set of demonstrations with an instruction. A genetic algorithm can select a top-performing prompt for variation or combination. section 6.2.2 section 6.5.1





