BOP-Elites, a Bayesian Optimisation algorithm for Quality-Diversity search
Paul Kent, Juergen Branke

TL;DR
BOP-Elites is a Bayesian optimisation algorithm designed for Quality-Diversity search that models both quality and diversity with Gaussian Processes, efficiently finding optimal solutions across multiple niches.
Contribution
It introduces a novel acquisition function and Bayesian modelling approach to improve sample efficiency and provide uncertainty quantification in QD algorithms.
Findings
More sample efficient than benchmark approaches
Effectively identifies optimal solutions in each niche
Provides uncertainty estimates and insights into the search space
Abstract
Quality Diversity (QD) algorithms such as MAP-Elites are a class of optimisation techniques that attempt to find a set of high-performing points from an objective function while enforcing behavioural diversity of the points over one or more interpretable, user chosen, feature functions. In this paper we propose the Bayesian Optimisation of Elites (BOP-Elites) algorithm that uses techniques from Bayesian Optimisation to explicitly model both quality and diversity with Gaussian Processes. By considering user defined regions of the feature space as 'niches' our task is to find the optimal solution in each niche. We propose a novel acquisition function to intelligently choose new points that provide the highest expected improvement to the ensemble problem of identifying the best solution in every niche. In this way each function evaluation enriches our modelling and provides insight to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Multi-Objective Optimization Algorithms · Gaussian Processes and Bayesian Inference · Metaheuristic Optimization Algorithms Research
