User Preference Meets Pareto-Optimality in Multi-Objective Bayesian Optimization
Joshua Hang Sai Ip, Ankush Chakrabarty, Ali Mesbah, Diego Romeres

TL;DR
This paper introduces PUB-MOBO, a novel multi-objective Bayesian optimization method that integrates user preferences with local search to efficiently find near-Pareto-optimal solutions, reducing computational costs and improving personalization.
Contribution
PUB-MOBO combines preference-based utility modeling with local multi-gradient descent, enabling targeted Pareto optimization guided by user preferences without estimating the entire Pareto-front.
Findings
PUB-MOBO outperforms existing methods in proximity to Pareto-front.
PUB-MOBO achieves lower utility regret across benchmark and real-world problems.
The method effectively personalizes multi-objective optimization results.
Abstract
Incorporating user preferences into multi-objective Bayesian optimization (MOBO) allows for personalization of the optimization procedure. Preferences are often abstracted in the form of an unknown utility function, estimated through pairwise comparisons of potential outcomes. However, utility-driven MOBO methods can yield solutions that are dominated by nearby solutions, as non-dominance is not enforced. Additionally, classical MOBO commonly relies on estimating the entire Pareto-front to identify the Pareto-optimal solutions, which can be expensive and ignore user preferences. Here, we present a new method, termed preference-utility-balanced MOBO (PUB-MOBO), that allows users to disambiguate between near-Pareto candidate solutions. PUB-MOBO combines utility-based MOBO with local multi-gradient descent to refine user-preferred solutions to be near-Pareto-optimal. To this end, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsAdvanced Multi-Objective Optimization Algorithms
