Contents
These are very important to review as most math related to gaussian processes is application of these fundamental results. Bayes rules: states that posterior probability is prior probability time the likelihood i.e. Where H is some hypothesis and E is evidence.
What does m ( x ) mean in Gaussian process?
Generally mean m (x) is zero: you can think of this work on batch normalised data. Definition: A gaussian process is defined by a collection of (infinite) random variable, specified via a covariance function K. Prior: When we draw prior samples from a GP we can obtain arbitrary function samples, as shown below.
What is the definition of a Gaussian process?
Definition: A gaussian process is defined by a collection of (infinite) random variable, specified via a covariance function K. Prior: When we draw prior samples from a GP we can obtain arbitrary function samples, as shown below. Posterior: With our training dataset (x,y) we can then obtain the posterior (y or f (x), since y=f (x)+noise).
How are Gaussian processes defined by second order statistics?
A key fact of Gaussian processes is that they can be completely defined by their second-order statistics. Thus, if a Gaussian process is assumed to have mean zero, defining the covariance function completely defines the process’ behaviour.
What do you need to know about the Gaussian process?
The Gaussian Process model section defines the Gaussian Process prior and the likelihood. And it explains the model parameters in the prior and the likelihood. The Computing the posterior section derives the posterior from the prior and the likelihood. And it describes how to make predictions using the posterior.
How to get the final Gaussian prediction function?
As everything is gaussian, we can apply marginalisation property, to obtain the final gaussian using Bayes rule, this gives mean prediction function and uncertainty via the variance.