Multi-Fidelity Multi-Objective Bayesian Optimization: An Output Space
Entropy Search Approach
- URL: http://arxiv.org/abs/2011.01542v1
- Date: Mon, 2 Nov 2020 06:59:04 GMT
- Title: Multi-Fidelity Multi-Objective Bayesian Optimization: An Output Space
Entropy Search Approach
- Authors: Syrine Belakaria, Aryan Deshwal and Janardhan Rao Doppa
- Abstract summary: We study the novel problem of blackbox optimization of multiple objectives via multi-fidelity function evaluations.
Our experiments on several synthetic and real-world benchmark problems show that MF-OSEMO, with both approximations, significantly improves over the state-of-the-art single-fidelity algorithms.
- Score: 44.25245545568633
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We study the novel problem of blackbox optimization of multiple objectives
via multi-fidelity function evaluations that vary in the amount of resources
consumed and their accuracy. The overall goal is to approximate the true Pareto
set of solutions by minimizing the resources consumed for function evaluations.
For example, in power system design optimization, we need to find designs that
trade-off cost, size, efficiency, and thermal tolerance using multi-fidelity
simulators for design evaluations. In this paper, we propose a novel approach
referred as Multi-Fidelity Output Space Entropy Search for Multi-objective
Optimization (MF-OSEMO) to solve this problem. The key idea is to select the
sequence of candidate input and fidelity-vector pairs that maximize the
information gained about the true Pareto front per unit resource cost. Our
experiments on several synthetic and real-world benchmark problems show that
MF-OSEMO, with both approximations, significantly improves over the
state-of-the-art single-fidelity algorithms for multi-objective optimization.
Related papers
- UCB-driven Utility Function Search for Multi-objective Reinforcement Learning [75.11267478778295]
In Multi-objective Reinforcement Learning (MORL) agents are tasked with optimising decision-making behaviours.
We focus on the case of linear utility functions parameterised by weight vectors w.
We introduce a method based on Upper Confidence Bound to efficiently search for the most promising weight vectors during different stages of the learning process.
arXiv Detail & Related papers (2024-05-01T09:34:42Z) - Multi-Objective GFlowNets [59.16787189214784]
We study the problem of generating diverse candidates in the context of Multi-Objective Optimization.
In many applications of machine learning such as drug discovery and material design, the goal is to generate candidates which simultaneously optimize a set of potentially conflicting objectives.
We propose Multi-Objective GFlowNets (MOGFNs), a novel method for generating diverse optimal solutions, based on GFlowNets.
arXiv Detail & Related papers (2022-10-23T16:15:36Z) - Joint Entropy Search for Multi-objective Bayesian Optimization [0.0]
We propose a novel information-theoretic acquisition function for BO called Joint Entropy Search.
We showcase the effectiveness of this new approach on a range of synthetic and real-world problems in terms of the hypervolume and its weighted variants.
arXiv Detail & Related papers (2022-10-06T13:19:08Z) - Uncertainty-Aware Search Framework for Multi-Objective Bayesian
Optimization [40.40632890861706]
We consider the problem of multi-objective (MO) blackbox optimization using expensive function evaluations.
We propose a novel uncertainty-aware search framework referred to as USeMO to efficiently select the sequence of inputs for evaluation.
arXiv Detail & Related papers (2022-04-12T16:50:48Z) - Leveraging Trust for Joint Multi-Objective and Multi-Fidelity
Optimization [0.0]
This paper investigates a novel approach to Bayesian multi-objective and multi-fidelity (MOMF) optimization.
We suggest the innovative use of a trust metric to support simultaneous optimization of multiple objectives and data sources.
Our methods offer broad applicability in solving simulation problems in fields such as plasma physics and fluid dynamics.
arXiv Detail & Related papers (2021-12-27T20:55:26Z) - Efficient Model-Based Multi-Agent Mean-Field Reinforcement Learning [89.31889875864599]
We propose an efficient model-based reinforcement learning algorithm for learning in multi-agent systems.
Our main theoretical contributions are the first general regret bounds for model-based reinforcement learning for MFC.
We provide a practical parametrization of the core optimization problem.
arXiv Detail & Related papers (2021-07-08T18:01:02Z) - Information-Theoretic Multi-Objective Bayesian Optimization with
Continuous Approximations [44.25245545568633]
We propose information-Theoretic Multi-Objective Bayesian Optimization with Continuous Approximations (iMOCA) to solve this problem.
Our experiments on diverse synthetic and real-world benchmarks show that iMOCA significantly improves over existing single-fidelity methods.
arXiv Detail & Related papers (2020-09-12T01:46:03Z) - Max-value Entropy Search for Multi-Objective Bayesian Optimization with
Constraints [44.25245545568633]
In aviation power system design applications, we need to find the designs that trade-off total energy and the mass while satisfying specific thresholds for motor temperature and voltage of cells.
We propose a new approach referred as em Max-value Entropy Search for Multi-objective Optimization with Constraints (MESMOC) to solve this problem.
MESMOC employs an output-space entropy based acquisition function to efficiently select the sequence of inputs for evaluation to uncover high-quality pareto-set solutions.
arXiv Detail & Related papers (2020-09-01T05:00:01Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.