Targeting Solutions in Bayesian Multi-Objective Optimization: Sequential and Batch Versions

Abstract

Multi-objective optimization aims at finding trade-off solutions to conflicting objectives. These constitute the Pareto optimal set. In the context of expensive-to-evaluate functions, it is impossible and often non-informative to look for the entire set. As an end-user would typically prefer a certain part of the objective space, we modify the Bayesian multi-objective optimization algorithm which uses Gaussian Processes to maximize the Expected Hypervolume Improvement, to focus the search in the preferred region. The cumulated effects of the Gaussian Processes and the targeting strategy lead to a particularly efficient convergence to the desired part of the Pareto set. To take advantage of parallel computing, a multi-point extension of the targeting criterion is proposed and analyzed.

References in corpus (2)

• Efficient batch-sequential Bayesian optimization with moments of truncated Gaussian vectors
• Budgeted Multi-Objective Optimization with a Focus on the Central Part of the Pareto Front -- Extended Version

Cited by in corpus (7)

• Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimization
• Multi-objective robust optimization using adaptive surrogate models for problems with mixed continuous-categorical parameters
• Reinforcement Learning from Human Feedback: Whose Culture, Whose Values, Whose Perspectives?
• Modeling and Optimization with Gaussian Processes in Reduced Eigenbases -- Extended Version
• Automatic Preference Based Multi-objective Evolutionary Algorithm on Vehicle Fleet Maintenance Scheduling Optimization
• A game theoretic perspective on Bayesian multi-objective optimization
• One Step Preference Elicitation in Multi-Objective Bayesian Optimization