def test_cmaes(self):
X_lower = np.array([0, 0])
X_upper = np.array([1, 1])
X = init_random_uniform(X_lower, X_upper, 10)
Y = np.sin(X[:, 0])[:, np.newaxis]
kernel = george.kernels.Matern52Kernel(np.ones([1, 1]),
ndim=2)
prior = TophatPrior(-2, 2)
model = GaussianProcess(kernel, prior=prior)
model.train(X, Y)
rec = PosteriorMeanOptimization(model, X_lower, X_upper,
method="cmaes")
startpoints = init_random_uniform(X_lower, X_upper, 10)
inc, inc_val = rec.estimate_incumbent(startpoints)
# Check shapes
assert len(inc.shape) == 2
assert inc.shape[0] == 1
assert inc.shape[1] == X_lower.shape[0]
assert len(inc_val.shape) == 2
assert inc_val.shape[0] == 1
assert inc_val.shape[1] == 1
# Check if incumbent is in the bounds
assert not np.any([np.any(inc[:, i] < X_lower[i])
for i in range(X_lower.shape[0])])
assert not np.any([np.any(inc[:, i] > X_upper[i])
for i in range(X_upper.shape[0])])
def setUp(self):
self.X = np.random.rand(10, 2)
self.y = np.sinc(self.X * 10 - 5).sum(axis=1)
kernel = george.kernels.Matern52Kernel(np.ones(self.X.shape[1]),
ndim=self.X.shape[1])
prior = TophatPrior(-2, 2)
self.model = GaussianProcess(kernel, prior=prior)
self.model.train(self.X, self.y, do_optimize=False)
def setUp(self):
self.X = np.random.randn(10, 2)
self.y = np.sinc(self.X * 10 - 5).sum(axis=1)
kernel = george.kernels.Matern52Kernel(np.ones(self.X.shape[1]),
ndim=self.X.shape[1])
prior = TophatPrior(-2, 2)
self.model = GaussianProcessMCMC(kernel,
prior=prior,
n_hypers=6,
burnin_steps=100,
chain_length=200)
self.model.train(self.X, self.y, do_optimize=True)
def test(self):
X_lower = np.array([0, 0])
X_upper = np.array([1, 1])
is_env = np.array([0, 1])
X = init_random_uniform(X_lower, X_upper, 10)
Y = np.sin(X)[:, None, 0]
kernel = george.kernels.Matern52Kernel(np.ones([2]), ndim=2)
prior = TophatPrior(-2, 2)
model = GaussianProcess(kernel, prior=prior)
model.train(X, Y)
rec = BestProjectedObservation(model, X_lower, X_upper, is_env)
inc, inc_val = rec.estimate_incumbent()
# Check shapes
assert len(inc.shape) == 2
assert inc.shape[0] == 1
assert inc.shape[1] == X_lower.shape[0]
assert len(inc_val.shape) == 2
assert inc_val.shape[0] == 1
assert inc_val.shape[1] == 1
# Check if incumbent is in the bounds
assert not np.any(
[np.any(inc[:, i] < X_lower[i]) for i in range(X_lower.shape[0])])
assert not np.any(
[np.any(inc[:, i] > X_upper[i]) for i in range(X_upper.shape[0])])
# Check if incumbent is the correct point
b = np.argmin(Y)
x_best = X[b, None, :]
assert np.all(inc[:, is_env == 0] == x_best[:, is_env == 0])
def test(self):
X_lower = np.array([0])
X_upper = np.array([1])
X = init_random_uniform(X_lower, X_upper, 10)
Y = np.sin(X)
kernel = george.kernels.Matern52Kernel(np.ones([1]), ndim=1)
prior = TophatPrior(-2, 2)
model = GaussianProcess(kernel, prior=prior)
model.train(X, Y)
x_test = init_random_uniform(X_lower, X_upper, 3)
# Shape matching predict
m, v = model.predict(x_test)
assert len(m.shape) == 2
assert m.shape[0] == x_test.shape[0]
assert m.shape[1] == 1
assert len(v.shape) == 2
assert v.shape[0] == x_test.shape[0]
assert v.shape[1] == x_test.shape[0]
#TODO: check gradients
# Shape matching function sampling
x_ = np.linspace(X_lower, X_upper, 10)
x_ = x_[:, np.newaxis]
funcs = model.sample_functions(x_, n_funcs=2)
assert len(funcs.shape) == 2
assert funcs.shape[0] == 2
assert funcs.shape[1] == x_.shape[0]
# Shape matching predict variance
x_test1 = np.array([np.random.rand(1)])
x_test2 = np.random.rand(10)[:, np.newaxis]
var = model.predict_variance(x_test1, x_test2)
assert len(var.shape) == 2
assert var.shape[0] == x_test2.shape[0]
assert var.shape[1] == 1
# Check compatibility with all acquisition functions
acq_func = EI(model, X_upper=X_upper, X_lower=X_lower)
acq_func.update(model)
acq_func(x_test)
acq_func = PI(model, X_upper=X_upper, X_lower=X_lower)
acq_func.update(model)
acq_func(x_test)
acq_func = LCB(model, X_upper=X_upper, X_lower=X_lower)
acq_func.update(model)
acq_func(x_test)
acq_func = InformationGain(model, X_upper=X_upper, X_lower=X_lower)
acq_func.update(model)
acq_func(x_test)
# Check compatibility with all incumbent estimation methods
rec = BestObservation(model, X_lower, X_upper)
inc, inc_val = rec.estimate_incumbent(None)
assert len(inc.shape) == 2
assert inc.shape[0] == 1
assert inc.shape[1] == X_upper.shape[0]
assert len(inc_val.shape) == 2
assert inc_val.shape[0] == 1
assert inc_val.shape[1] == 1
rec = PosteriorMeanOptimization(model, X_lower, X_upper)
startpoints = init_random_uniform(X_lower, X_upper, 4)
inc, inc_val = rec.estimate_incumbent(startpoints)
assert len(inc.shape) == 2
assert inc.shape[0] == 1
assert inc.shape[1] == X_upper.shape[0]
assert len(inc_val.shape) == 2
assert inc_val.shape[0] == 1
assert inc_val.shape[1] == 1
rec = PosteriorMeanAndStdOptimization(model, X_lower, X_upper)
startpoints = init_random_uniform(X_lower, X_upper, 4)
inc, inc_val = rec.estimate_incumbent(startpoints)
assert len(inc.shape) == 2
assert inc.shape[0] == 1
assert inc.shape[1] == X_upper.shape[0]
assert len(inc_val.shape) == 2
assert inc_val.shape[0] == 1
assert inc_val.shape[1] == 1
