Covering Multiple Objectives with a Small Set of Solutions Using Bayesian Optimization

In multi-objective black-box optimization, the goal is typically to find solutions that optimize a set of T black-box objective functions, f 1 , . . . f T , simultaneously. Traditional approaches often seek a single Pareto-optimal set that balances tradeoffs among all objectives. In contrast, we consider a problem setting that departs from this paradigm: finding a small set of K < T solutions, that collectively "cover" the T objectives. A set of solutions is defined as "covering" if, for each objective f 1 , . . . f T , there is at least one good solution. A motivating example for this problem setting occurs in drug design. For example, we may have T pathogens and aim to identify a set of K < T antibiotics such that at least one antibiotic can be used to treat each pathogen. This problem, known as coverage optimization, has yet to be tackled with the Bayesian optimization (BO) framework. To fill this void, we develop Multi-Objective Coverage Bayesian Optimization (MOCOBO), a BO algorithm for solving coverage optimization. Our approach is based on a new acquisition function reminiscent of expected improvement in the vanilla BO setup. We demonstrate the performance of our method on high-dimensional black-box optimization tasks, including applications in peptide and molecular design. Results show that the coverage of the K < T solutions found by MOCOBO matches or nearly matches the coverage of T solutions obtained by optimizing each objective individually. Furthermore, in in vitro experiments, the peptides found by MOCOBO exhibited high potency against drug-resistant pathogens, further demonstrating the potential of MOCOBO for drug discovery. All of our code is publicly available at the following link: https://github.com/nataliemaus/mocobo.