Information-theoretic Inducing Point Placement for High-throughput Bayesian Optimisation
Not on the map. Why?
Abstract (arXiv)
Sparse Gaussian Processes are a key component of high-throughput Bayesian optimisation (BO) loops -- an increasingly common setting where evaluation budgets are large and highly parallelised. By using representative subsets of the available data to build approximate posteriors, sparse models dramatically reduce the computational costs of surrogate modelling by relying on a small set of pseudo-observations, the so-called inducing points, in lieu of the full data set. However, current approaches to design inducing points are not appropriate within BO loops as they seek to reduce global uncertainty in the objective function. Thus, the high-fidelity modelling of promising and data-dense regions required for precise optimisation is sacrificed and computational resources are instead wasted on modelling areas of the space already known to be sub-optimal. Inspired by entropy-based BO methods, we propose a novel inducing point design that uses a principled information-theoretic criterion to select inducing points. By choosing inducing points to maximally reduce both global uncertainty and uncertainty in the maximum value of the objective function, we build surrogate models able to support high-precision high-throughput BO.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 12 of its 20 references that are in the map. First posted on arXiv 6 Jun 2022.
Builds on
12 of 20 references.
References · 12
- 2013Gaussian Processes for Big Datacited by 377
- 2017Max-value Entropy Search for Efficient Bayesian Optimizationcited by 202
- 2014Predictive Entropy Search for Efficient Global Optimization of Black-box Functionscited by 201
- 2020Efficiently Sampling Functions from Gaussian Process Posteriorscited by 125
- 2019Rates of Convergence for Sparse Variational Gaussian Process Regressioncited by 62
- 2021GIBBON: General-purpose Information-Based Bayesian OptimisatioNcited by 47
- 2020Scalable Thompson Sampling using Sparse Gaussian Process Modelscited by 39
- 2020MUMBO: MUlti-task Max-value Bayesian Optimizationcited by 21
- 2017Fast Information-theoretic Bayesian Optimisationcited by 19
- 2019Multi-fidelity Bayesian Optimization with Max-value Entropy Search and its parallelizationcited by 19
- 2020Bayesian Quantile and Expectile Optimisationcited by 17
- 2016Exact Sampling from Determinantal Point Processescited by 5
Built on by
Citing papers per year: 2022: 2; 2023: 2; 2024: 0; 2025: 1.
5 papers.
- 2022GAUCHE: A Library for Gaussian Processes in Chemistrycited by 40
- 2023Inducing Point Allocation for Sparse Gaussian Processes in High-Throughput Bayesian Optimisationcited by 32
- 2025Return of the Latent Space COWBOYS: Re-thinking the use of VAEs for Bayesian Optimisation of Structured Spacescited by 13
- 2023Trieste: Efficiently Exploring The Depths of Black-box Functions with TensorFlowcited by 11
- 2022Fantasizing with Dual GPs in Bayesian Optimization and Active Learningcited by 7
- 2025Return of the Latent Space COWBOYS: Re-thinking the use of VAEs for Bayesian Optimisation of Structured Spaces5 Jul 2025
- 2023Trieste: Efficiently Exploring The Depths of Black-box Functions with TensorFlow16 Feb 2023
- 2023Inducing Point Allocation for Sparse Gaussian Processes in High-Throughput Bayesian Optimisation24 Jan 2023
- 2022GAUCHE: A Library for Gaussian Processes in Chemistry6 Dec 2022
- 2022Fantasizing with Dual GPs in Bayesian Optimization and Active Learning2 Nov 2022