“…A common approach to optimizing over discrete designs is to perform evolutionary search (ES) over a population of candidate designs [5,6,19,20,21,7,22,23,24,25,8,26,9,27]. However, ES is prone to local minima and is sample-inefficient, in part due to the need to maintain separate control policies for each candidate design in the population.…”