Restricting ambitions in global multi-objective optimization of costly functions
Résumé
In the context of the multi-objective optimization of costly functions, it may only be possible to find specific parts of the Pareto front even with Bayesian algorithms.
In this talk, we introduce a Bayesian criterion for targeted multi-objective optimization that is related to but computationally cheaper than the Expected Hypercube Improvement (EHI). We also define the Pareto front center and discuss its properties and its estimation. Finally, we propose the Centered-EHI algorithm that adapts the size of the searched Pareto region to the computational resources.
These slides are a seminar version of the preprint arXiv:1809.10482 .
Origine | Fichiers produits par l'(les) auteur(s) |
---|