2022/08/07 by Kaifeng Yang, Yang, Kaifeng, Guozhi Dong +3
Computer Science · Mathematics · #Advanced Multi-Objective Optimization Algorithms #Advanced Optimization Algorithms Research #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Metaheuristic Optimization Algorithms Research
paper · pdf · doi:10.48550/arxiv.2208.03685
openalex publication_date 2022/08/07 · openalex created_date 2022/10/05 · openalex updated_date 2026/07/28
Bayesian global optimization (BGO) is an efficient surrogate-assisted technique for problems involving expensive evaluations. A parallel technique can be used to parallelly evaluate the true-expensive objective functions in one iteration to boost the execution time. An effective and straightforward approach is to design an acquisition function that can evaluate the performance of a bath of multiple solutions, instead of a single point/solution, in one iteration. This paper proposes five alternatives of Probability of Improvement (PoI) with multiple points in a batch (q-PoI) for multi-objective Bayesian global optimization (MOBGO), taking the covariance among multiple points into account. Both exact computational formulas and the Monte Carlo approximation algorithms for all proposed q-PoIs are provided. Based on the distribution of the multiple points relevant to the Pareto-front, the position-dependent behavior of the five q-PoIs is investigated. Moreover, the five q-PoIs are compared with the other nine state-of-the-art and recently proposed batch MOBGO algorithms on twenty bio-objective benchmarks. The empirical experiments on different variety of benchmarks are conducted to demonstrate the effectiveness of two greedy q-PoIs (\kpoibest and \kpoiall) on low-dimensional problems and the effectiveness of two explorative q-PoIs (\kpoione and \kpoiworst) on high-dimensional problems with difficult-to-approximate Pareto front boundaries.