{PF}2 ES: Parallel Feasible Pareto Frontier Entropy Search for Multi-Objective Bayesian Optimization

Qing, Jixiang and Moss, Henry B and Dhaene, Tom and Couckuyt, Ivo (2023) {PF}2 ES: Parallel Feasible Pareto Frontier Entropy Search for Multi-Objective Bayesian Optimization. In: International Conference on Artificial Intelligence and Statistics :. Proceedings of Machine Learning Research, 206 . PMLR, pp. 2565-2588.

Full text not available from this repository.

Abstract

We present Parallel Feasible Pareto Frontier Entropy Search ({PF}2 ES) — a novel information-theoretic acquisition function for multi-objective Bayesian optimization supporting unknown constraints and batch queries. Due to the complexity of characterizing the mutual information between candidate evaluations and (feasible) Pareto frontiers, existing approaches must either employ crude approximations that significantly hamper their performance or rely on expensive inference schemes that substantially increase the optimization’s computational overhead. By instead using a variational lower bound, {PF}2 ES provides a low-cost and accurate estimate of the mutual information. We benchmark {PF}2 ES against other information-theoretic acquisition functions, demonstrating its competitive performance for optimization across synthetic and real-world design problems.

Item Type:
Contribution in Book/Report/Proceedings
ID Code:
227142
Deposited By:
Deposited On:
28 May 2025 13:50
Refereed?:
Yes
Published?:
Published
Last Modified:
13 Jun 2025 03:50