Published April 9, 2021 | Version v1
Conference paper Open

Maximising Hypervolume and Minimising epsilon-Indicators using Bayesian Optimisation over Sets

  • 1. University of Exeter
  • 2. University of Málaga


Code and datasets for:

Tinkle Chugh and Manuel López-Ibáñez. Maximising Hypervolume and Minimising Epsilon-Indicators using Bayesian Optimisation over Sets. In F. Chicano and K. Krawiec, editors, Genetic and Evolutionary Computation Conference Companion, GECCO 2021. ACM Press, New York, NY, 2021. doi:10.1145/3449726.3463178.

Latest version of the code may be found at:

Abstract: Bayesian optimisation methods have been widely used to solve problems with computationally expensive objective functions. In the multi-objective case, these methods have been successfully applied to maximise the expected hypervolume improvement of individual solutions. However, the hypervolume, and other unary quality indicators such as multiplicative $\epsilon$-indicator, measure the quality of an approximation set and the overall goal is to find the set with the best indicator value. Unfortunately, the literature on Bayesian optimisation over sets is scarce. This work uses a recent set-based kernel in Gaussian processes and applies it to maximise hypervolume and minimise epsilon-indicators in Bayesian optimisation over sets. The results on benchmark problems show that maximising hypervolume using Bayesian optimisation over sets gives a similar performance than non-set based methods. The performance of using epsilon indicator in Bayesian optimisation over sets needs to be investigated further. The set-based method is computationally more expensive than the non-set-based ones, but the overall time may be still negligible in practice compared to the expensive objective functions.


Files (1.8 MB)