Bayesian optimization
E899020
black-box optimization technique
global optimization method
sample-efficient optimization method
sequential model-based optimization
Bayesian optimization is a sample-efficient global optimization strategy that uses probabilistic surrogate models, typically Gaussian processes, to optimize expensive black-box functions with as few evaluations as possible.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Bayesian optimization canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T11003163 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Bayesian optimization Context triple: [AutoML: A Survey of the State-of-the-Art, topic, Bayesian optimization]
-
A.
Bayes optimality
Bayes optimality is a criterion in statistical decision theory under which a decision rule minimizes expected loss with respect to a given prior distribution, making it the benchmark for comparing and justifying optimal procedures.
-
B.
Gaussian process
A Gaussian process is a collection of random variables indexed by a set (often time or space) such that every finite subset has a joint multivariate normal distribution, widely used to model functions in probability theory and machine learning.
-
C.
Optimization over Time
"Optimization over Time" is a seminal work by Peter Whittle that develops mathematical methods for making optimal sequential decisions in dynamic and stochastic systems.
-
D.
Bayesian Occam factor
The Bayesian Occam factor is a term in Bayesian model comparison that automatically penalizes overly complex models by integrating over their larger parameter spaces, thereby implementing Occam’s razor in probabilistic inference.
-
E.
Adam: A Method for Stochastic Optimization
"Adam: A Method for Stochastic Optimization" is a highly influential machine learning paper that introduces the Adam optimizer, a widely used adaptive gradient-based optimization algorithm for training deep neural networks.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Bayesian optimization Target entity description: Bayesian optimization is a sample-efficient global optimization strategy that uses probabilistic surrogate models, typically Gaussian processes, to optimize expensive black-box functions with as few evaluations as possible.
-
A.
Bayes optimality
Bayes optimality is a criterion in statistical decision theory under which a decision rule minimizes expected loss with respect to a given prior distribution, making it the benchmark for comparing and justifying optimal procedures.
-
B.
Gaussian process
A Gaussian process is a collection of random variables indexed by a set (often time or space) such that every finite subset has a joint multivariate normal distribution, widely used to model functions in probability theory and machine learning.
-
C.
Optimization over Time
"Optimization over Time" is a seminal work by Peter Whittle that develops mathematical methods for making optimal sequential decisions in dynamic and stochastic systems.
-
D.
Bayesian Occam factor
The Bayesian Occam factor is a term in Bayesian model comparison that automatically penalizes overly complex models by integrating over their larger parameter spaces, thereby implementing Occam’s razor in probabilistic inference.
-
E.
Adam: A Method for Stochastic Optimization
"Adam: A Method for Stochastic Optimization" is a highly influential machine learning paper that introduces the Adam optimizer, a widely used adaptive gradient-based optimization algorithm for training deep neural networks.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
black-box optimization technique
ⓘ
global optimization method ⓘ sample-efficient optimization method ⓘ sequential model-based optimization ⓘ |
| aimsTo |
minimize the number of function evaluations
ⓘ
optimize expensive black-box functions ⓘ |
| appliesTo |
continuous optimization problems
ⓘ
experimental design ⓘ hyperparameter optimization in machine learning ⓘ mixed discrete-continuous optimization problems ⓘ simulation-based optimization ⓘ |
| assumes |
function evaluations are expensive
ⓘ
function evaluations may be noisy ⓘ |
| basedOn |
Bayesian inference
NERFINISHED
ⓘ
sequential decision making ⓘ |
| challenge |
parallel and batch evaluations design
ⓘ
scaling to high-dimensional problems ⓘ |
| commonAcquisitionFunction |
entropy search
ⓘ
expected improvement ⓘ knowledge gradient ⓘ probability of improvement ⓘ upper confidence bound ⓘ |
| commonSurrogateModel |
Bayesian neural networks
NERFINISHED
ⓘ
Gaussian process regression ⓘ random forests ⓘ |
| contrastsWith |
gradient-based optimization methods
ⓘ
grid search ⓘ random search ⓘ |
| handles | black-box objectives without analytic gradients ⓘ |
| models | posterior distribution over objective functions ⓘ |
| oftenAssumes | low-dimensional search spaces ⓘ |
| originField |
machine learning
ⓘ
operations research ⓘ statistics ⓘ |
| property |
global search capability
ⓘ
handles noisy observations ⓘ non-convex optimization capability ⓘ sample efficiency ⓘ |
| relatedTo |
active learning
ⓘ
multi-armed bandits ⓘ optimal experimental design ⓘ |
| requires |
likelihood model for observations
ⓘ
prior over functions ⓘ |
| selects | next evaluation point by maximizing an acquisition function ⓘ |
| updates | surrogate model with new observations ⓘ |
| uses |
Gaussian processes
NERFINISHED
ⓘ
acquisition functions ⓘ probabilistic surrogate models ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Bayesian optimization Description of subject: Bayesian optimization is a sample-efficient global optimization strategy that uses probabilistic surrogate models, typically Gaussian processes, to optimize expensive black-box functions with as few evaluations as possible.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.