Preference-Aware Constrained Multi-Objective Bayesian Optimization (Student Abstract)

We consider the problem of constrained multi-objective optimization over black-box objectives, with user-defined preferences, with a largely infeasible input space. Our goal is to approximate the optimal Pareto set from the small fraction of feasible inputs. The main challenges include huge design space, multiple objectives, numerous constraints, and rare feasible inputs identified only through expensive experiments. We present PAC-MOO, a novel preference-aware multi-objective Bayesian optimization algorithm to solve this problem. It leverages surrogate models for objectives and constraints to intelligently select the sequence of inputs for evaluation to achieve the target goal.

Authors

• Alaleh Ahmadianshalchi Washington State University
• Syrine Belakaria Stanford University
• Janardhan Rao Doppa Washington State University

Keywords

• Bayesian Optimization
• Constrained Optimization
• Multi-objective Optimization
• Probabilistic Models