MOBO-OSD: Batch Multi-Objective Bayesian Optimization via Orthogonal Search Directions
Bayesian Optimization (BO) is a powerful tool for optimizing expensive black-box objective functions. While extensive research has been conducted on the single-objective optimization problem, the multi-objective optimization problem remains challenging. In this paper, we propose MOBO-OSD, a multi-objective Bayesian Optimization algorithm designed to generate a diverse set of Pareto optimal solutions by solving multiple constrained optimization problems, referred to as MOBO-OSD subproblems, along orthogonal search directions (OSDs) defined with respect to an approximated convex hull of individual objective minima. By employing a well-distributed set of OSDs, MOBO-OSD ensures broad coverage of the objective space, enhancing both solution diversity and hypervolume performance. To further improve the density of the set of Pareto optimal candidate solutions without requiring an excessive number of subproblems, we leverage a Pareto Front Estimation technique to generate additional solutions in the neighborhood of existing solutions. Additionally, MOBO-OSD supports batch optimization, enabling parallel function evaluations to accelerate the optimization process when resources are available. Through extensive experiments and analysis on a variety of synthetic and real-world benchmark functions with two to six objectives, we demonstrate that MOBO-OSD consistently outperforms the state-of-the-art algorithms. Our code implementation can be found at https://github.com/LamNgo1/mobo-osd.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal Thompson sampling
Classical evolutionary approaches for multiobjective optimization are quite accurate but incur a lot of queries to the objectives; this can be prohibitive when objectives are expensive oracles. A sample-efficient approac…
Bayesian OptimizationComputational EfficiencyMultiobjective OptimizationThompson SamplingA penalisation method for batch multi-objective Bayesian optimisation with application in heat exchanger design
We present HIghly Parallelisable Pareto Optimisation (HIPPO) -- a batch acquisition function that enables multi-objective Bayesian optimisation methods to efficiently exploit parallel processing resources. Multi-Objectiv…
Bayesian OptimisationDiversityParallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement
Optimizing multiple competing black-box objectives is a challenging problem in many fields, including science, engineering, and machine learning. Multi-objective Bayesian optimization (MOBO) is a sample-efficient approac…
Bayesian OptimizationPareto Set Learning for Expensive Multi-Objective Optimization
Expensive multi-objective optimization problems can be found in many real-world applications, where their objective function evaluations involve expensive computations or physical experiments. It is desirable to obtain a…
Bayesian OptimizationDecision MakingBOFormer: Learning to Solve Multi-Objective Bayesian Optimization via Non-Markovian RL
Bayesian optimization (BO) offers an efficient pipeline for optimizing black-box functions with the help of a Gaussian process prior and an acquisition function (AF). Recently, in the context of single-objective BO, lear…
Bayesian OptimizationHyperparameter OptimizationLanguage ModelingLanguage Modelling+1