A game theoretic perspective on Bayesian multi-objective optimization

arXiv2104.14456MaRDI QIDQ6366454FDOQ6366454

Authors: M. Binois, A. Habbal, Victor Picheny 

Publication date: 29 April 2021

Abstract: This chapter addresses the question of how to efficiently solve many-objective optimization problems in a computationally demanding black-box simulation context. We shall motivate the question by applications in machine learning and engineering, and discuss specific harsh challenges in using classical Pareto approaches when the number of objectives is four or more. Then, we review solutions combining approaches from Bayesian optimization, e.g., with Gaussian processes, and concepts from game theory like Nash equilibria, Kalai-Smorodinsky solutions and detail extensions like Nash-Kalai-Smorodinsky solutions. We finally introduce the corresponding algorithms and provide some illustrating results.

This page was built for publication: A game theoretic perspective on Bayesian multi-objective optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6366454)