gaussian_process_formulation
bojaxns.gaussian_process_formulation
Submodules
Package Contents
- class AbstractAcquisition[source]
A class that represents any acquisition function. All acquisition functions take a point in the U-domain and returns a metric that gives a proxy as to how valuable it would be to try that point. All acquisition values only make sense relatively.
- class MarginalisedAcquisitionFunction(key, ns_results, acquisition_factory, S)[source]
Bases:
AbstractAcquisitionClass that represents a marginalisation of an acquisition function over samples.
- Parameters:
key (jax.random.PRNGKey) –
ns_results (MarginalisationData) –
acquisition_factory (AcquisitionFactory) –
S (int) –
- class OptimisationExperiment[source]
Bases:
pydantic.BaseModel- parameter_space: bojaxns.parameter_space.ParameterSpace
- class GaussianProcessData[source]
Bases:
NamedTuple- U: jax.numpy.ndarray
- Y: jax.numpy.ndarray
- Y_var: jax.numpy.ndarray
- sample_size: jax.numpy.ndarray
- class GaussianProcessConditionalPredictiveFactory(data)[source]
Bases:
bojaxns.base.ConditionalPredictiveFactory- Parameters:
data (GaussianProcessData) –
- psd_kernels()[source]
- Return type:
List[Type[tensorflow_probability.substrates.jax.math.psd_kernels.PositiveSemidefiniteKernel]]
- class ExpectedImprovementAcquisitionFactory(conditional_predictive_factory)[source]
Bases:
bojaxns.base.AcquisitionFactory- Parameters:
conditional_predictive_factory (GaussianProcessConditionalPredictiveFactory) –
- class TopTwoAcquisitionFactory(conditional_predictive_factory, u1)[source]
Bases:
bojaxns.base.AcquisitionFactory- Parameters:
conditional_predictive_factory (GaussianProcessConditionalPredictiveFactory) –
u1 (jax.numpy.ndarray) –
- run_multi_lookahead(rng_key, data, ns_results, batch_size, max_depth, num_actions, num_simulations, S)[source]
- Parameters:
rng_key (chex.PRNGKey) –
data (bojaxns.gaussian_process_formulation.distribution_math.GaussianProcessData) –
ns_results (bojaxns.base.MarginalisationData) –
batch_size (int) –
max_depth (int) –
num_actions (int) –
num_simulations (int) –
S (int) –
- Return type:
Tuple[chex.Array, mctx.PolicyOutput[mctx.GumbelMuZeroExtraData]]
- convert_tree_to_graph(tree, action_labels=None, batch_index=0)[source]
Converts a search tree into a Graphviz graph.
- class BayesianOptimiser(experiment, num_parallel_solvers=1, beta=0.5, S=512)[source]
- Parameters:
experiment (bojaxns.experiment.OptimisationExperiment) –
num_parallel_solvers (int) –
beta (float) –
S (int) –
- posterior_solve(key)[source]
- Parameters:
key (chex.PRNGKey) –
- Return type:
jaxns.internals.types.NestedSamplerResults
- search_U_top1(key, ns_results, batch_size, num_search)[source]
- Parameters:
key (chex.PRNGKey) –
ns_results (bojaxns.base.MarginalisationData) –
batch_size (int) –
num_search (int) –
- search_U_top2(key, ns_results, u1, batch_size, num_search)[source]
- Parameters:
key (chex.PRNGKey) –
ns_results (bojaxns.base.MarginalisationData) –
u1 (jax.numpy.ndarray) –
batch_size (int) –
num_search (int) –