Batch Selection for Parallelisation of Bayesian Quadrature
Integration over non-negative integrands is a central problem in machine learning (e.g. for model averaging, (hyper-)parameter marginalisation, and computing posterior predictive distributions). Bayesian Quadrature is a probabilistic numerical integration technique that performs promisingly when compared to traditional Markov Chain Monte Carlo methods. However, in contrast to easily-parallelised MCMC methods, Bayesian Quadrature methods have, thus far, been essentially serial in nature, selecting a single point to sample at each step of the algorithm. We deliver methods to select batches of points at each step, based upon those recently presented in the Batch Bayesian Optimisation literature. Such parallelisation significantly reduces computation time, especially when the integrand is expensive to sample.
Code (1)
Tasks
Bayesian OptimisationBIG-bench Machine LearningNumerical IntegrationSimilar Papers 제목 키워드 기반
A Quadrature Approach for General-Purpose Batch Bayesian Optimization via Probabilistic Lifting
Parallelisation in Bayesian optimisation is a common strategy but faces several challenges: the need for flexibility in acquisition functions and kernel choices, flexibility dealing with discrete and continuous variables…
Bayesian OptimisationBayesian OptimizationFast Bayesian Inference with Batch Bayesian Quadrature via Kernel Recombination
Calculation of Bayesian posteriors and model evidences typically requires numerical integration. Bayesian quadrature (BQ), a surrogate-model-based approach to numerical integration, is capable of superb sample efficiency…
Bayesian InferenceNumerical IntegrationSOBER: Highly Parallel Bayesian Optimization and Bayesian Quadrature over Discrete and Mixed Spaces
Batch Bayesian optimisation and Bayesian quadrature have been shown to be sample-efficient methods of performing optimisation and quadrature where expensive-to-evaluate objective functions can be queried in parallel. How…
Bayesian OptimisationBayesian OptimizationDrug DiscoveryAdaptive Batch Sizes for Active Learning A Probabilistic Numerics Approach
Active learning parallelization is widely used, but typically relies on fixing the batch size throughout experimentation. This fixed approach is inefficient because of a dynamic trade-off between cost and speed -- larger…
Active LearningBayesian OptimisationBayesian OptimizationDrug DiscoveryBayesian Model Selection of Lithium-Ion Battery Models via Bayesian Quadrature
A wide variety of battery models are available, and it is not always obvious which model `best' describes a dataset. This paper presents a Bayesian model selection approach using Bayesian quadrature. The model evidence i…
Model Selection