BEACON: A Bayesian Optimization Strategy for Novelty Search in Expensive Black-Box Systems
Wei-Ting Tang, Ankush Chakrabarty, Joel A. Paulson

TL;DR
BEACON is a Bayesian optimization-based method for efficient novelty search in expensive black-box systems, enabling diverse behavior discovery with fewer evaluations.
Contribution
We introduce BEACON, a novel sample-efficient novelty search approach using Gaussian processes, suitable for high-dimensional and costly black-box system explorations.
Findings
BEACON outperforms existing methods in synthetic benchmarks.
BEACON discovers more diverse behaviors in real-world tasks.
BEACON maintains scalability with large input spaces.
Abstract
Novelty search (NS) refers to a class of exploration algorithms that seek to uncover diverse system behaviors through simulations or experiments. Such diversity is central to many AI-driven discovery and design tasks, including material and drug development, neural architecture search, and reinforcement learning. However, existing NS methods typically rely on evolutionary strategies and other meta-heuristics that require dense sampling of the input space, making them impractical for expensive black-box systems. In this work, we introduce BEACON, a sample-efficient, Bayesian optimization-inspired approach to NS that is tailored for settings where the input-to-behavior relationship is opaque and costly to evaluate. BEACON models this mapping using multi-output Gaussian processes (MOGPs) and selects new inputs by maximizing a novelty metric computed from posterior samples of the MOGP,…
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
TopicsCloud Computing and Resource Management · Data Stream Mining Techniques · Scientific Computing and Data Management
MethodsGaussian Process
