Targeting Solutions in Bayesian Multi-Objective Optimization: Sequential and Batch Versions - Archive ouverte HAL Access content directly
Journal Articles Annals of Mathematics and Artificial Intelligence Year : 2019

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

(1, 2, 3, 4, 5) , (5, 1, 3, 4, 6) , (7) , (2) , (2)
1
2
3
4
5
6
7

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.

Dates and versions

emse-01957614 , version 1 (17-12-2018)

Identifiers

Cite

David Gaudrie, Rodolphe Le Riche, Victor Picheny, Benoit Enaux, Vincent Herbert. Targeting Solutions in Bayesian Multi-Objective Optimization: Sequential and Batch Versions. Annals of Mathematics and Artificial Intelligence, 2019, pp 1-26. ⟨10.1007/s10472-019-09644-8⟩. ⟨emse-01957614⟩
167 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More