<jupyter_start><jupyter_text>Scalable Additive-Structure GP Classification (CUDA) (w/ KISS-GP) IntroductionThis example shows how to use a `AdditiveGridInducingVariationalGP` module. This classifcation module is designed for when the function you’re modeling has an additive decomposition over dimension. This is equivalent to using a covariance function that additively decomposes over dimensions:$$k(\mathbf{x},\mathbf{x'}) = \sum_{i=1}^{d}k([\mathbf{x}]_{i}, [\mathbf{x'}]_{i})$$where $[\mathbf{x}]_{i}$ denotes the ith component of the vector $\mathbf{x}$. Example applications of this include use in Bayesian optimization, and when performing deep kernel learning. The use of inducing points allows for scaling up the training data by making computational complexity linear instead of cubic in the number of data points.In this example, we’re performing classification on a two dimensional toy dataset that is:- Defined in [-1, 1]x[-1, 1]- Valued 1 in [-0.5, 0.5]x[-0.5, 0.5]- Valued -1 otherwiseThe above function doesn't have an obvious additive decomposition, but it turns out that this function is can be very well approximated by the kernel anyways.<jupyter_code># High-level imports
import math
import torch
import gpytorch
from matplotlib import pyplot as plt

# Make inline plots
%matplotlib inline<jupyter_output><empty_output><jupyter_text>Generate toy dataset<jupyter_code>n = 201
train_x = torch.zeros(n ** 2, 2)
train_x[:, 0].copy_(torch.linspace(-1, 1, n).repeat(n))
train_x[:, 1].copy_(torch.linspace(-1, 1, n).unsqueeze(1).repeat(1, n).view(-1))
train_y = (train_x[:, 0].abs().lt(0.5)).float() * (train_x[:, 1].abs().lt(0.5)).float() * 2 - 1

train_x = train_x.cuda()
train_y = train_y.cuda()<jupyter_output><empty_output><jupyter_text>Define the modelIn contrast to the most basic classification models, this model extends `AdditiveGridInducingVariationalGP`. This causes two key changes in the model. First, the base class specifically assumes that the input to `forward`, `x`, is to be additive decomposed. Thus, although the model below defines an `RBFKernel` as the covariance function, because we extend this base class, the additive decomposition discussed above will be imposed. Second, this model automatically assumes we will be using scalable kernel interpolation (SKI) for each dimension. Because of the additive decomposition, we only provide one set of grid bounds to the base class constructor, as the same grid will be used for all dimensions. It is recommended that you scale your training and test data appropriately.<jupyter_code># For GP Classification we use the AdditiveGridInducingVariationalGP model
class GPClassificationModel(gpytorch.models.AdditiveGridInducingVariationalGP):
    def __init__(self):
        super(GPClassificationModel, self).__init__(grid_size=100, grid_bounds=[(-1, 1)], num_dim=2)
        self.mean_module = gpytorch.means.ConstantMean()
        self.covar_module = gpytorch.kernels.ScaleKernel(
            gpytorch.kernels.RBFKernel(
                log_lengthscale_prior=gpytorch.priors.SmoothedBoxPrior(
                    math.exp(0), math.exp(3), sigma=0.1, log_transform=True
                )
            )
        )
        
        
    def forward(self,x):
        mean_x = self.mean_module(x)
        covar_x = self.covar_module(x)
        latent_pred = gpytorch.distributions.MultivariateNormal(mean_x, covar_x)
        return latent_pred

# Cuda the model and likelihood function
model = GPClassificationModel().cuda()
likelihood = gpytorch.likelihoods.BernoulliLikelihood().cuda()<jupyter_output><empty_output><jupyter_text>Training the modelOnce the model has been defined, the training loop looks very similar to other variational models we've seen in the past. We will optimize the variational lower bound as our objective function. In this case, although variational inference in GPyTorch supports stochastic gradient descent, we choose to do batch optimization due to the relatively small toy dataset.For an example of using the `AdditiveGridInducingVariationalGP` model with stochastic gradient descent, see the `dkl_mnist` example.<jupyter_code># Find optimal model hyperparameters
model.train()
likelihood.train()

# Use the adam optimizer
optimizer = torch.optim.Adam([
    {'params': model.parameters()},
    # BernoulliLikelihood has no parameters
], lr=0.1)

# "Loss" for GPs - the marginal log likelihood
# n_data refers to the amount of training data
mll = gpytorch.mlls.VariationalMarginalLogLikelihood(likelihood, model, num_data=len(train_y))

# Training function
def train():
    num_iter = 25
    for i in range(num_iter):
        optimizer.zero_grad()
        output = model(train_x)
        loss = -mll(output, train_y)
        loss.backward()
        print('Iter %d/%d - Loss: %.3f' % (i + 1, num_iter, loss.item()))
        optimizer.step()

# Sometimes we get better performance on the GPU when we don't use Toeplitz math
# for SKI. This flag controls that
with gpytorch.settings.use_toeplitz(False):
    %time train()<jupyter_output>Iter 1/25 - Loss: 7.721
Iter 2/25 - Loss: 7.207
Iter 3/25 - Loss: 6.038
Iter 4/25 - Loss: 5.675
Iter 5/25 - Loss: 5.187
Iter 6/25 - Loss: 4.906
Iter 7/25 - Loss: 4.509
Iter 8/25 - Loss: 4.415
Iter 9/25 - Loss: 4.142
Iter 10/25 - Loss: 3.955
Iter 11/25 - Loss: 3.860
Iter 12/25 - Loss: 3.716
Iter 13/25 - Loss: 3.944
Iter 14/25 - Loss: 3.687
Iter 15/25 - Loss: 3.784
Iter 16/25 - Loss: 3.864
Iter 17/25 - Loss: 3.658
Iter 18/25 - Loss: 3.758
Iter 19/25 - Loss: 3.974
Iter 20/25 - Loss: 3.667
Iter 21/25 - Loss: 3.648
Iter 22/25 - Loss: 3.653
Iter 23/25 - Loss: 3.575
Iter 24/25 - Loss: 3.478
Iter 25/25 - Loss: 3.541
CPU times: user 7.08 s, sys: 424 ms, total: 7.51 s
Wall time: 7.5 s<jupyter_text>Test the modelNext we test the model and plot the decision boundary. Despite the function we are optimizing not having an obvious additive decomposition, the model provides accurate results.<jupyter_code># Switch the model and likelihood into the evaluation mode
model.eval()
likelihood.eval()

# Start the plot, 4x3in
f, ax = plt.subplots(1, 1, figsize=(4, 3))

n = 100
test_x = torch.zeros(n ** 2, 2)
test_x[:, 0].copy_(torch.linspace(-1, 1, n).repeat(n))
test_x[:, 1].copy_(torch.linspace(-1, 1, n).unsqueeze(1).repeat(1, n).view(-1))
# Cuda variable of test data
test_x = test_x.cuda()

with torch.no_grad(), gpytorch.settings.use_toeplitz(False):
    predictions = likelihood(model(test_x))

# prob<0.5 --> label -1 // prob>0.5 --> label 1
pred_labels = predictions.mean.ge(0.5).float().mul(2).sub(1).cpu()
# Colors = yellow for 1, red for -1
color = []
for i in range(len(pred_labels)):
    if pred_labels[i] == 1:
        color.append('y')
    else:
        color.append('r')
        
# Plot data a scatter plot
ax.scatter(test_x[:, 0].cpu(), test_x[:, 1].cpu(), color=color, s=1)
ax.set_ylim([-0.5, 1.5])<jupyter_output><empty_output>
{'fraction_non_alphanumeric': 0.1104330136588201, 'fraction_numerical': 0.04286544609125254, 'mean_word_length': 4.090976331360947, 'pattern_counts': {'":': 0, '<': 21, '<?xml version=': 0, '>': 23, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '5', 'dir': 'jupyter-structured-clean-dedup', 'id': '267306', 'license': 'MIT', 'n_tokens_mistral': 2400, 'n_tokens_neox': 2180, 'n_words': 754, 'path': 'examples/07_Scalable_GP_Classification_Multidimensional/KISSGP_Additive_Classification_CUDA.ipynb', 'repo_name': 'konstantinklemmer/gpytorch', 'size': '6882'}