Browse State-of-the-Art › Bayesian Optimisation
Bayesian Optimisation
97 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
Expensive black-box functions are a common problem in many disciplines, including tuning the parameters of machine learning algorithms, robotics, and other engineering design problems. Bayesian Optimisation is a principled and efficient technique for the global optimisation of these functions. The idea behind Bayesian Optimisation is to place a prior distribution over the target function and then update that prior with a set of “true” observations of the target function by expensively evaluating it in order to produce a posterior predictive distribution. The posterior then informs where to make the next observation of the target function through the use of an acquisition function, which balances the exploitation of regions known to have good performance with the exploration of regions where there is little information about the function’s response.
Source: A Bayesian Approach for the Robust Optimisation of Expensive-to-Evaluate Functions
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
1 subtask in the archive's task tree.
Parent tasks archive 2025-07-28
Most implemented papers archive 2025-07-28
30 shown of 97 papers with code (221 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
6 Mar 2017 4 repositories listedWe propose a new criterion, Max-value Entropy Search (MES), that instead uses the information about the maximum function value.
-
25 Jul 2022 3 repositories listedIn this paper we explore cyber security defence, through the unification of a novel cyber security simulator with models for (causal) decision-making through optimisation.
-
7 Dec 2020 3 repositories listedOur results on the Bayesmark benchmark indicate that heteroscedasticity and non-stationarity pose significant challenges for black-box optimisers.
-
22 Oct 2024 2 repositories listed Syntology ran 3 of 4 samples · 1 unverified · 1 pointer-only (licence)We derive a bound on the maximum information gain of these invariant kernels, and provide novel upper and lower bounds on the number of observations required for invariance-aware BO algorithms to achieve ϵ-optimality.
-
11 Jan 2024 2 repositories listedMachine learning has emerged as a powerful solution to the modern challenges in accelerator physics.
-
25 May 2023 2 repositories listedWe enable this end-to-end framework with reinforcement learning (RL) to tackle the lack of labelled acquisition data.
-
30 Jan 2023 2 repositories listedLearning decompositions of expensive-to-evaluate black-box functions promises to scale Bayesian optimisation (BO) to high-dimensional problems.
-
6 Dec 2022 2 repositories listed Syntology ran 0 of 10 samples · 10 unverifiedBy defining such kernels in GAUCHE, we seek to open the door to powerful tools for uncertainty quantification and Bayesian optimisation in chemistry.
-
7 Jun 2021 2 repositories listedWe introduce a method combining variational autoencoders (VAEs) and deep metric learning to perform Bayesian optimisation (BO) over high-dimensional and structured input spaces.
-
3 Apr 2020 2 repositories listedNeural Architecture Search (NAS) was first proposed to achieve state-of-the-art performance through the discovery of new architecture patterns, without human intervention.
-
14 Oct 2019 2 repositories listedBayesian optimization provides sample-efficient global optimization for a broad range of applications, including automatic machine learning, engineering, physics, and experimental design.
-
2 Sep 2019 2 repositories listed Syntology ran 1 of 13 samples · 12 unverifiedWhile Bayesian neural networks (BNNs) hold the promise of being flexible, well-calibrated statistical models, inference often requires approximations whose consequences are poorly understood.
-
20 Jun 2019 2 repositories listed Syntology ran 0 of 7 samples · 7 unverifiedEfficient optimisation of black-box problems that comprise both continuous and categorical inputs is important, yet poses significant challenges.
-
23 Jun 2015 2 repositories listedWe consider the problem of approximate Bayesian parameter inference in non-linear state-space models with intractable likelihoods.
-
25 Feb 2025 1 repository listedThis paper considers the challenging computational task of estimating nested expectations.
-
17 Feb 2025 1 repository listedWe address the problem of optimising the average payoff for a large number of cooperating agents, where the payoff function is unknown and treated as a black box.
-
6 Dec 2024 1 repository listedBayesian optimisation, one of the most well-known techniques, typically employs Gaussian processes as surrogate models, leveraging their probabilistic nature to balance exploration and exploitation.
-
31 Oct 2024 1 repository listedWe propose practical deep Gaussian process models on Riemannian manifolds, similar in spirit to residual neural networks.
-
18 Oct 2024 1 repository listedAccurate uncertainty quantification for causal effects is essential for robust decision making in complex systems, but remains challenging in non-parametric settings.
-
14 Oct 2024 1 repository listed Syntology ran 3 of 9 samples · 6 unverified · 9 pointer-only (licence)Experts' labels are often costly, requiring efficient use of their efforts, and can at the same time be unreliable, requiring careful adjustment of the degree to which any expert is trusted.
-
14 Oct 2024 1 repository listedWe formally derive a cumulative regret bound of LB and compare it with the regret of an oracle BO algorithm using the optimal length scale.
-
18 Apr 2024 1 repository listed Syntology ran 7 of 11 samples · 4 unverifiedParallelisation 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…
-
4 Apr 2024 1 repository listedLarge Language Models (LLMs) have exhibited remarkable proficiency in comprehending and generating natural language.
-
5 Feb 2024 1 repository listedENVBO finds solutions for the full domain of the environmental variable that outperforms results from optimisation algorithms that only focus on a fixed environmental value in all but one case while using a fraction of…
-
12 Jan 2024 1 repository listedPositive-Unlabelled (PU) learning is a growing field of machine learning that aims to learn classifiers from data consisting of labelled positive and unlabelled instances, which can be in reality positive or negative,…
-
5 Dec 2023 1 repository listed Syntology ran 6 of 10 samples · 4 unverifiedDomain experts often possess valuable physical insights that are overlooked in fully automated decision-making processes such as Bayesian optimisation.
-
24 Nov 2023 1 repository listed Syntology ran 3 of 3 samples · 0 unverified · 3 pointer-only (licence)We replace this assumption with a weaker one only requiring the shape of the optimisation landscape to be similar, and analyse the recent method Prior Learning for Bayesian Optimisation - PLeBO - in this setting.
-
1 Nov 2023 1 repository listed Syntology ran 2 of 2 samples · 0 unverified · 2 pointer-only (licence)To enable closed form conditioning, a common assumption in Gaussian process (GP) regression is independent and identically distributed Gaussian observation noise.
-
31 Oct 2023 1 repository listed Syntology ran 15 of 19 samples · 4 unverifiedWe study the use of stochastic gradient descent for solving this linear system, and show that when \emph{done right} -- by which we mean using specific insights from the optimisation and kernel communities -- stochastic…
-
9 Jun 2023 1 repository listed Syntology ran 1 of 1 samples · 0 unverified · 1 pointer-only (licence)Active learning parallelization is widely used, but typically relies on fixing the batch size throughout experimentation.
Syntology lines on 11 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections