# Gaussian process

__: Statistical model__

**Short description**In probability theory and statistics, a **Gaussian process** is a stochastic process (a collection of random variables indexed by time or space), such that every finite collection of those random variables has a multivariate normal distribution. The distribution of a Gaussian process is the joint distribution of all those (infinitely many) random variables, and as such, it is a distribution over functions with a continuous domain, e.g. time or space.

The concept of Gaussian processes is named after Carl Friedrich Gauss because it is based on the notion of the Gaussian distribution (normal distribution). Gaussian processes can be seen as an infinite-dimensional generalization of multivariate normal distributions.

Gaussian processes are useful in statistical modelling, benefiting from properties inherited from the normal distribution. For example, if a random process is modelled as a Gaussian process, the distributions of various derived quantities can be obtained explicitly. Such quantities include the average value of the process over a range of times and the error in estimating the average using sample values at a small set of times. While exact models often scale poorly as the amount of data increases, multiple approximation methods have been developed which often retain good accuracy while drastically reducing computation time.

## Definition

A time continuous stochastic process [math]\displaystyle{ \left\{X_t ; t\in T\right\} }[/math] is Gaussian if and only if for every finite set of indices [math]\displaystyle{ t_1,\ldots,t_k }[/math] in the index set [math]\displaystyle{ T }[/math]

[math]\displaystyle{ \mathbf{X}_{t_1, \ldots, t_k} = (X_{t_1}, \ldots, X_{t_k}) }[/math]

is a multivariate Gaussian random variable.^{[1]} That is the same as saying every linear combination of [math]\displaystyle{ (X_{t_1}, \ldots, X_{t_k}) }[/math] has a univariate normal (or Gaussian) distribution.

Using characteristic functions of random variables with [math]\displaystyle{ i }[/math] denoting the imaginary unit such that [math]\displaystyle{ i^2 =-1 }[/math], the Gaussian property can be formulated as follows: [math]\displaystyle{ \left\{X_t ; t\in T\right\} }[/math] is Gaussian if and only if, for every finite set of indices [math]\displaystyle{ t_1,\ldots,t_k }[/math], there are real-valued [math]\displaystyle{ \sigma_{\ell j} }[/math], [math]\displaystyle{ \mu_\ell }[/math] with [math]\displaystyle{ \sigma_{jj} \gt 0 }[/math] such that the following equality holds for all [math]\displaystyle{ s_1,s_2,\ldots,s_k\in\mathbb{R} }[/math],

[math]\displaystyle{ { \mathbb E }\left[\exp\left(i \sum_{\ell=1}^k s_\ell \, \mathbf{X}_{t_\ell}\right)\right] = \exp \left(-\tfrac{1}{2} \sum_{\ell, j} \sigma_{\ell j} s_\ell s_j + i \sum_\ell \mu_\ell s_\ell\right), }[/math]

or [math]\displaystyle{ { \mathbb E } \left[ {\mathrm e}^{ i\, \mathbf{s}\, (\mathbf{X}_t - \mathbf{\mu}) } \right] = {\mathrm e}^{ - \mathbf{s}\, \sigma\, \mathbf{s}/2 } }[/math].
The numbers [math]\displaystyle{ \sigma_{\ell j} }[/math] and [math]\displaystyle{ \mu_\ell }[/math] can be shown to be the covariances and means of the variables in the process.^{[2]}

## Variance

The variance of a Gaussian process is finite at any time [math]\displaystyle{ t }[/math], formally^{[3]}^{:p. 515}
[math]\displaystyle{ \operatorname{var}[X(t)] = { \mathbb E } \left[\left|X(t)-\operatorname{E}[X(t)]\right|^2\right] \lt \infty \quad \text{for all } t \in T. }[/math]

## Stationarity

For general stochastic processes strict-sense stationarity implies wide-sense stationarity but not every wide-sense stationary stochastic process is strict-sense stationary. However, for a Gaussian stochastic process the two concepts are equivalent.^{[3]}^{:p. 518}

A Gaussian stochastic process is strict-sense stationary if and only if it is wide-sense stationary.

## Example

There is an explicit representation for stationary Gaussian processes.^{[4]} A simple example of this representation is

[math]\displaystyle{ X_t = \cos(at)\, \xi_1 + \sin(at)\, \xi_2 }[/math]

where [math]\displaystyle{ \xi_1 }[/math] and [math]\displaystyle{ \xi_2 }[/math] are independent random variables with the standard normal distribution.

## Covariance functions

A key fact of Gaussian processes is that they can be completely defined by their second-order statistics.^{[5]} Thus, if a Gaussian process is assumed to have mean zero, defining the covariance function completely defines the process' behaviour. Importantly the non-negative definiteness of this function enables its spectral decomposition using the Karhunen–Loève expansion. Basic aspects that can be defined through the covariance function are the process' stationarity, isotropy, smoothness and periodicity.^{[6]}^{[7]}

Stationarity refers to the process' behaviour regarding the separation of any two points [math]\displaystyle{ x }[/math] and [math]\displaystyle{ x' }[/math]. If the process is stationary, the covariance function depends only on [math]\displaystyle{ x-x' }[/math]. For example, the Ornstein–Uhlenbeck process is stationary.

If the process depends only on [math]\displaystyle{ |x-x'| }[/math], the Euclidean distance (not the direction) between [math]\displaystyle{ x }[/math] and [math]\displaystyle{ x' }[/math], then the process is considered isotropic. A process that is concurrently stationary and isotropic is considered to be homogeneous;^{[8]} in practice these properties reflect the differences (or rather the lack of them) in the behaviour of the process given the location of the observer.

Ultimately Gaussian processes translate as taking priors on functions and the smoothness of these priors can be induced by the covariance function.^{[6]} If we expect that for "near-by" input points [math]\displaystyle{ x }[/math] and [math]\displaystyle{ x' }[/math] their corresponding output points [math]\displaystyle{ y }[/math] and [math]\displaystyle{ y' }[/math] to be "near-by" also, then the assumption of continuity is present. If we wish to allow for significant displacement then we might choose a rougher covariance function. Extreme examples of the behaviour is the Ornstein–Uhlenbeck covariance function and the squared exponential where the former is never differentiable and the latter infinitely differentiable.

Periodicity refers to inducing periodic patterns within the behaviour of the process. Formally, this is achieved by mapping the input [math]\displaystyle{ x }[/math] to a two dimensional vector [math]\displaystyle{ u(x) = \left( \cos(x), \sin(x) \right) }[/math].

### Usual covariance functions

There are a number of common covariance functions:^{[7]}

- Constant : [math]\displaystyle{ K_\operatorname{C}(x,x') = C }[/math]
- Linear: [math]\displaystyle{ K_\operatorname{L}(x,x') = x^\mathsf{T} x' }[/math]
- white Gaussian noise: [math]\displaystyle{ K_\operatorname{GN}(x,x') = \sigma^2 \delta_{x,x'} }[/math]
- Squared exponential: [math]\displaystyle{ K_\operatorname{SE}(x,x') = \exp \left(-\tfrac{|d|^2}{2\ell^2} \right) }[/math]
- Ornstein–Uhlenbeck: [math]\displaystyle{ K_\operatorname{OU}(x,x') = \exp \left(-\tfrac{|d|} \ell \right) }[/math]
- Matérn: [math]\displaystyle{ K_\operatorname{Matern}(x,x') = \tfrac{2^{1-\nu}}{\Gamma(\nu)} \left(\tfrac{\sqrt{2\nu}|d|}{\ell} \right)^\nu K_\nu \left(\tfrac{\sqrt{2\nu}|d|}{\ell} \right) }[/math]
- Periodic: [math]\displaystyle{ K_\operatorname{P}(x,x') = \exp\left(-\tfrac{2}{\ell^2} \sin^2 (d/2) \right) }[/math]
- Rational quadratic: [math]\displaystyle{ K_\operatorname{RQ}(x,x') = \left(1+|d|^2\right)^{-\alpha}, \quad \alpha \geq 0 }[/math]

Here [math]\displaystyle{ d = x- x' }[/math]. The parameter [math]\displaystyle{ \ell }[/math] is the characteristic length-scale of the process (practically, "how close" two points [math]\displaystyle{ x }[/math] and [math]\displaystyle{ x' }[/math] have to be to influence each other significantly), *[math]\displaystyle{ \delta }[/math]* is the Kronecker delta and [math]\displaystyle{ \sigma }[/math] the standard deviation of the noise fluctuations. Moreover, [math]\displaystyle{ K_\nu }[/math] is the modified Bessel function of order [math]\displaystyle{ \nu }[/math] and [math]\displaystyle{ \Gamma(\nu) }[/math] is the gamma function evaluated at [math]\displaystyle{ \nu }[/math]. Importantly, a complicated covariance function can be defined as a linear combination of other simpler covariance functions in order to incorporate different insights about the data-set at hand.

The inferential results are dependent on the values of the hyperparameters [math]\displaystyle{ \theta }[/math] (e.g. [math]\displaystyle{ \ell }[/math] and [math]\displaystyle{ \sigma }[/math]) defining the model's behaviour. A popular choice for [math]\displaystyle{ \theta }[/math] is to provide *maximum a posteriori* (MAP) estimates of it with some chosen prior. If the prior is very near uniform, this is the same as maximizing the marginal likelihood of the process; the marginalization being done over the observed process values [math]\displaystyle{ y }[/math].^{[7]} This approach is also known as *maximum likelihood II*, *evidence maximization*, or *empirical Bayes*.^{[9]}

## Continuity

For a Gaussian process, continuity in probability is equivalent to mean-square continuity,^{[10]}^{:145}
and continuity with probability one is equivalent to sample continuity.^{[11]}^{:91 "Gaussian processes are discontinuous at fixed points."}
The latter implies, but is not implied by, continuity in probability.
Continuity in probability holds if and only if the mean and autocovariance are continuous functions. In contrast, sample continuity was challenging even for stationary Gaussian processes (as probably noted first by Andrey Kolmogorov), and more challenging for more general processes.^{[12]}^{:Sect. 2.8}
^{[13]}^{:69,81}
^{[14]}^{:80}
^{[15]}
As usual, by a sample continuous process one means a process that admits a sample continuous modification.
^{[16]}^{:292}
^{[17]}^{:424}

### Stationary case

For a stationary Gaussian process [math]\displaystyle{ X=(X_t)_{t\in\R}, }[/math] some conditions on its spectrum are sufficient for sample continuity, but fail to be necessary. A necessary and sufficient condition, sometimes called Dudley–Fernique theorem, involves the function [math]\displaystyle{ \sigma }[/math] defined by [math]\displaystyle{ \sigma(h) = \sqrt{ {\mathbb E} \big[ X(t+h) - X(t) \big]^2 } }[/math] (the right-hand side does not depend on [math]\displaystyle{ t }[/math] due to stationarity). Continuity of [math]\displaystyle{ X }[/math] in probability is equivalent to continuity of [math]\displaystyle{ \sigma }[/math] at [math]\displaystyle{ 0. }[/math] When convergence of [math]\displaystyle{ \sigma(h) }[/math] to [math]\displaystyle{ 0 }[/math] (as [math]\displaystyle{ h\to 0 }[/math]) is too slow, sample continuity of [math]\displaystyle{ X }[/math] may fail. Convergence of the following integrals matters: [math]\displaystyle{ I(\sigma) = \int_0^1 \frac{ \sigma(h) }{ h \sqrt{ \log(1/h) } } \, dh = \int_0^\infty 2\sigma( e^{-x^2}) \, dx , }[/math] these two integrals being equal according to integration by substitution [math]\displaystyle{ h = e^{-x^2}, }[/math] [math]\displaystyle{ x = \sqrt{\log(1/h)} . }[/math] The first integrand need not be bounded as [math]\displaystyle{ h\to 0+, }[/math] thus the integral may converge ([math]\displaystyle{ I(\sigma)\lt \infty }[/math]) or diverge ([math]\displaystyle{ I(\sigma)=\infty }[/math]). Taking for example [math]\displaystyle{ \sigma( e^{-x^2}) = \tfrac{1}{x^a} }[/math] for large [math]\displaystyle{ x, }[/math] that is, [math]\displaystyle{ \sigma(h) = (\log(1/h))^{-a/2} }[/math] for small [math]\displaystyle{ h, }[/math] one obtains [math]\displaystyle{ I(\sigma)\lt \infty }[/math] when [math]\displaystyle{ a\gt 1, }[/math] and [math]\displaystyle{ I(\sigma)=\infty }[/math] when [math]\displaystyle{ 0 \lt a\le 1. }[/math] In these two cases the function [math]\displaystyle{ \sigma }[/math] is increasing on [math]\displaystyle{ [0,\infty), }[/math] but generally it is not. Moreover, the condition

does not follow from continuity of [math]\displaystyle{ \sigma }[/math] and the evident relations [math]\displaystyle{ \sigma(h) \ge 0 }[/math] (for all [math]\displaystyle{ h }[/math]) and [math]\displaystyle{ \sigma(0) = 0. }[/math]

**Theorem 1** — Let [math]\displaystyle{ \sigma }[/math] be continuous and satisfy (*). Then the condition [math]\displaystyle{ I(\sigma) \lt \infty }[/math] is necessary and sufficient for sample continuity of [math]\displaystyle{ X. }[/math]

Some history.^{[17]}^{:424}
Sufficiency was announced by Xavier Fernique in 1964, but the first proof was published by Richard M. Dudley in 1967.^{[16]}^{:Theorem 7.1}
Necessity was proved by Michael B. Marcus and Lawrence Shepp in 1970.^{[18]}^{:380}

There exist sample continuous processes [math]\displaystyle{ X }[/math] such that [math]\displaystyle{ I(\sigma)=\infty; }[/math] they violate condition (*). An example found by Marcus and Shepp ^{[18]}^{:387} is a random lacunary Fourier series
[math]\displaystyle{ X_t = \sum_{n=1}^\infty c_n ( \xi_n \cos \lambda_n t + \eta_n \sin \lambda_n t ) , }[/math]
where [math]\displaystyle{ \xi_1,\eta_1,\xi_2,\eta_2,\dots }[/math] are independent random variables with standard normal distribution; frequencies [math]\displaystyle{ 0\lt \lambda_1\lt \lambda_2\lt \dots }[/math] are a fast growing sequence; and coefficients [math]\displaystyle{ c_n\gt 0 }[/math] satisfy [math]\displaystyle{ \sum_n c_n \lt \infty. }[/math] The latter relation implies

[math]\displaystyle{ {\mathbb E} \sum_n c_n ( |\xi_n| + |\eta_n| ) = \sum_n c_n {\mathbb E} [ |\xi_n| + |\eta_n| ] = \text{const} \cdot \sum_n c_n \lt \infty, }[/math]

whence [math]\displaystyle{ \sum_n c_n ( |\xi_n| + |\eta_n| ) \lt \infty }[/math] almost surely, which ensures uniform convergence of the Fourier series almost surely, and sample continuity of [math]\displaystyle{ X. }[/math]

Its autocovariation function [math]\displaystyle{ {\mathbb E}[X_t X_{t+h}] = \sum_{n=1}^\infty c_n^2 \cos \lambda_n h }[/math] is nowhere monotone (see the picture), as well as the corresponding function [math]\displaystyle{ \sigma, }[/math] [math]\displaystyle{ \sigma(h) = \sqrt{ 2 {\mathbb E}[X_t X_t] - 2 {\mathbb E}[X_t X_{t+h}] } = 2 \sqrt{ \sum_{n=1}^\infty c_n^2 \sin^2 \frac{\lambda_n h}2 } . }[/math]

## Brownian motion as the integral of Gaussian processes

A Wiener process (also known as Brownian motion) is the integral of a white noise generalized Gaussian process. It is not stationary, but it has stationary increments.

The Ornstein–Uhlenbeck process is a stationary Gaussian process.

The Brownian bridge is (like the Ornstein–Uhlenbeck process) an example of a Gaussian process whose increments are not independent.

The fractional Brownian motion is a Gaussian process whose covariance function is a generalisation of that of the Wiener process.

## Driscoll's zero-one law

Driscoll's zero-one law is a result characterizing the sample functions generated by a Gaussian process.

Let [math]\displaystyle{ f }[/math] be a mean-zero Gaussian process [math]\displaystyle{ \left\{X_t ; t\in T\right\} }[/math] with non-negative definite covariance function [math]\displaystyle{ K }[/math]. Let [math]\displaystyle{ \mathcal{H}(R) }[/math] be a Reproducing kernel Hilbert space with positive definite kernel [math]\displaystyle{ R }[/math].

Then [math]\displaystyle{ \lim_{n\to\infty} \operatorname{tr}[K_n R_n^{-1}] \lt \infty, }[/math] where [math]\displaystyle{ K_n }[/math] and [math]\displaystyle{ R_n }[/math] are the covariance matrices of all possible pairs of [math]\displaystyle{ n }[/math] points, implies [math]\displaystyle{ \Pr[f \in \mathcal{H}(R)] = 1. }[/math]

Moreover,
[math]\displaystyle{ \lim_{n\to\infty} \operatorname{tr}[K_n R_n^{-1}] = \infty }[/math]
implies ^{[19]}
[math]\displaystyle{ \Pr[f \in \mathcal{H}(R)] = 0. }[/math]

This has significant implications when [math]\displaystyle{ K = R }[/math], as [math]\displaystyle{ \lim_{n \to \infty} \operatorname{tr}[R_n R_n^{-1}] = \lim_{n\to\infty}\operatorname{tr}[I] = \lim_{n \to \infty} n = \infty. }[/math]

As such, almost all sample paths of a mean-zero Gaussian process with positive definite kernel [math]\displaystyle{ K }[/math] will lie outside of the Hilbert space [math]\displaystyle{ \mathcal{H}(K) }[/math].

## Linearly constrained Gaussian processes

For many applications of interest some pre-existing knowledge about the system at hand is already given. Consider e.g. the case where the output of the Gaussian process corresponds to a magnetic field; here, the real magnetic field is bound by Maxwell's equations and a way to incorporate this constraint into the Gaussian process formalism would be desirable as this would likely improve the accuracy of the algorithm.

A method on how to incorporate linear constraints into Gaussian processes already exists:^{[20]}

Consider the (vector valued) output function [math]\displaystyle{ f(x) }[/math] which is known to obey the linear constraint (i.e. [math]\displaystyle{ \mathcal{F}_X }[/math] is a linear operator) [math]\displaystyle{ \mathcal{F}_X(f(x)) = 0. }[/math] Then the constraint [math]\displaystyle{ \mathcal{F}_X }[/math] can be fulfilled by choosing [math]\displaystyle{ f(x) = \mathcal{G}_X(g(x)) }[/math], where [math]\displaystyle{ g(x) \sim \mathcal{GP}(\mu_g, K_g) }[/math] is modelled as a Gaussian process, and finding [math]\displaystyle{ \mathcal{G}_X }[/math] such that [math]\displaystyle{ \mathcal{F}_X(\mathcal{G}_X(g)) = 0 \qquad \forall g. }[/math] Given [math]\displaystyle{ \mathcal{G}_X }[/math] and using the fact that Gaussian processes are closed under linear transformations, the Gaussian process for [math]\displaystyle{ f }[/math] obeying constraint [math]\displaystyle{ \mathcal{F}_X }[/math] becomes [math]\displaystyle{ f(x) = \mathcal{G}_X g \sim \mathcal{GP} ( \mathcal{G}_X \mu_g, \mathcal{G}_X K_g \mathcal{G}_{X'}^\mathsf{T} ). }[/math] Hence, linear constraints can be encoded into the mean and covariance function of a Gaussian process.

## Applications

A Gaussian process can be used as a prior probability distribution over functions in Bayesian inference.^{[7]}^{[22]} Given any set of *N* points in the desired domain of your functions, take a multivariate Gaussian whose covariance matrix parameter is the Gram matrix of your *N* points with some desired kernel, and sample from that Gaussian. For solution of the multi-output prediction problem, Gaussian process regression for vector-valued function was developed. In this method, a 'big' covariance is constructed, which describes the correlations between all the input and output variables taken in *N* points in the desired domain.^{[23]} This approach was elaborated in detail for the matrix-valued Gaussian processes and generalised to processes with 'heavier tails' like Student-t processes.^{[24]}

Inference of continuous values with a Gaussian process prior is known as Gaussian process regression, or kriging; extending Gaussian process regression to multiple target variables is known as *cokriging*.^{[25]} Gaussian processes are thus useful as a powerful non-linear multivariate interpolation tool.

Gaussian processes are also commonly used to tackle numerical analysis problems such as numerical integration, solving differential equations, or optimisation in the field of probabilistic numerics.

Gaussian processes can also be used in the context of mixture of experts models, for example.^{[26]}^{[27]} The underlying rationale of such a learning framework consists in the assumption that a given mapping cannot be well captured by a single Gaussian process model. Instead, the observation space is divided into subsets, each of which is characterized by a different mapping function; each of these is learned via a different Gaussian process component in the postulated mixture.

In the natural sciences, Gaussian processes have found use as probabilistic models of astronomical time series and as predictors of molecular properties.^{[28]}

### Gaussian process prediction, or Kriging

When concerned with a general Gaussian process regression problem (Kriging), it is assumed that for a Gaussian process [math]\displaystyle{ f }[/math] observed at coordinates [math]\displaystyle{ x }[/math], the vector of values [math]\displaystyle{ f(x) }[/math] is just one sample from a multivariate Gaussian distribution of dimension equal to number of observed coordinates [math]\displaystyle{ n }[/math]. Therefore, under the assumption of a zero-mean distribution, [math]\displaystyle{ f (x') \sim N (0, K(\theta,x,x')) }[/math], where [math]\displaystyle{ K(\theta,x,x') }[/math] is the covariance matrix between all possible pairs [math]\displaystyle{ (x,x') }[/math] for a given set of hyperparameters *θ*.^{[7]}
As such the log marginal likelihood is:

[math]\displaystyle{ \log p(f(x')\mid\theta,x) = -\frac{1}{2} \left(f(x)^\mathsf{T} K(\theta,x,x')^{-1} f(x') + \log \det(K(\theta,x,x')) + n \log 2\pi \right) }[/math]

and maximizing this marginal likelihood towards θ provides the complete specification of the Gaussian process *f*. One can briefly note at this point that the first term corresponds to a penalty term for a model's failure to fit observed values and the second term to a penalty term that increases proportionally to a model's complexity. Having specified θ, making predictions about unobserved values [math]\displaystyle{ f(x^*) }[/math] at coordinates *x** is then only a matter of drawing samples from the predictive distribution [math]\displaystyle{ p(y^*\mid x^*,f(x),x) = N(y^*\mid A,B) }[/math] where the posterior mean estimate A is defined as
[math]\displaystyle{ A = K(\theta,x^*,x) K(\theta,x,x')^{-1} f(x) }[/math]
and the posterior variance estimate *B* is defined as:
[math]\displaystyle{ B = K(\theta,x^*,x^*) - K(\theta,x^*,x) K(\theta,x,x')^{-1} K(\theta,x^*,x)^\mathsf{T} }[/math]
where [math]\displaystyle{ K(\theta,x^*,x) }[/math] is the covariance between the new coordinate of estimation *x** and all other observed coordinates *x* for a given hyperparameter vector θ, [math]\displaystyle{ K(\theta,x,x') }[/math] and [math]\displaystyle{ f(x) }[/math] are defined as before and [math]\displaystyle{ K(\theta,x^*,x^*) }[/math] is the variance at point *x** as dictated by θ. It is important to note that practically the posterior mean estimate of [math]\displaystyle{ f(x^*) }[/math] (the "point estimate") is just a linear combination of the observations [math]\displaystyle{ f(x) }[/math]; in a similar manner the variance of [math]\displaystyle{ f(x^*) }[/math] is actually independent of the observations [math]\displaystyle{ f(x) }[/math]. A known bottleneck in Gaussian process prediction is that the computational complexity of inference and likelihood evaluation is cubic in the number of points |*x*|, and as such can become unfeasible for larger data sets.^{[6]} Works on sparse Gaussian processes, that usually are based on the idea of building a *representative set* for the given process *f*, try to circumvent this issue.^{[29]}^{[30]} The kriging method can be used in the latent level of a nonlinear mixed-effects model for a spatial functional prediction: this technique is called the latent kriging.^{[31]}

Often, the covariance has the form [math]\displaystyle{ K(\theta, x,x') = \frac{1}{\sigma^2} \tilde{K}(\theta,x,x') }[/math], where [math]\displaystyle{ \sigma^2 }[/math] is a scaling parameter. Examples are the Matérn class covariance functions. If this scaling parameter [math]\displaystyle{ \sigma^2 }[/math] is either known or unknown (i.e. must be marginalized), then the posterior probability, [math]\displaystyle{ p(\theta \mid D) }[/math], i.e. the probability for the hyperparameters [math]\displaystyle{ \theta }[/math] given a set of data pairs [math]\displaystyle{ D }[/math] of observations of [math]\displaystyle{ x }[/math] and [math]\displaystyle{ f(x) }[/math], admits an analytical expression.^{[32]}

### Bayesian neural networks as Gaussian processes

Bayesian neural networks are a particular type of Bayesian network that results from treating deep learning and artificial neural network models probabilistically, and assigning a prior distribution to their parameters. Computation in artificial neural networks is usually organized into sequential layers of artificial neurons. The number of neurons in a layer is called the layer width. As layer width grows large, many Bayesian neural networks reduce to a Gaussian process with a closed form compositional kernel. This Gaussian process is called the Neural Network Gaussian Process (NNGP).^{[7]}^{[33]}^{[34]} It allows predictions from Bayesian neural networks to be more efficiently evaluated, and provides an analytic tool to understand deep learning models.

## Computational issues

In practical applications, Gaussian process models are often evaluated on a grid leading to multivariate normal distributions. Using these models for prediction or parameter estimation using maximum likelihood requires evaluating a multivariate Gaussian density, which involves calculating the determinant and the inverse of the covariance matrix. Both of these operations have cubic computational complexity which means that even for grids of modest sizes, both operations can have a prohibitive computational cost. This drawback led to the development of multiple approximation methods.

## See also

- Bayes linear statistics
- Bayesian interpretation of regularization
- Kriging
- Gaussian free field
- Gauss–Markov process
- Gradient-enhanced kriging (GEK)
- Student's t-process

## References

- ↑ MacKay, David, J.C. (2003).
*Information Theory, Inference, and Learning Algorithms*.*Cambridge University Press*. pp. 540. ISBN 9780521642989. http://www.inference.phy.cam.ac.uk/itprnn/book.pdf. "The probability distribution of a function [math]\displaystyle{ y(\mathbf{x}) }[/math] is a Gaussian processes if for any finite selection of points [math]\displaystyle{ \mathbf{x}^{(1)},\mathbf{x}^{(2)},\ldots,\mathbf{x}^{(N)} }[/math], the density [math]\displaystyle{ P(y(\mathbf{x}^{(1)}),y(\mathbf{x}^{(2)}),\ldots,y(\mathbf{x}^{(N)})) }[/math]is a Gaussian" - ↑ Dudley, R.M. (1989).
*Real Analysis and Probability*. Wadsworth and Brooks/Cole. ISBN 0-534-10050-3. - ↑
^{3.0}^{3.1}Amos Lapidoth (8 February 2017).*A Foundation in Digital Communication*. Cambridge University Press. ISBN 978-1-107-17732-1. https://books.google.com/books?id=6oTuDQAAQBAJ&q=independence. - ↑ Kac, M.; Siegert, A.J.F (1947). "An Explicit Representation of a Stationary Gaussian Process".
*The Annals of Mathematical Statistics***18**(3): 438–442. doi:10.1214/aoms/1177730391. - ↑ Bishop, C.M. (2006).
*Pattern Recognition and Machine Learning*. Springer. ISBN 978-0-387-31073-2. - ↑
^{6.0}^{6.1}^{6.2}Barber, David (2012).*Bayesian Reasoning and Machine Learning*.*Cambridge University Press*. ISBN 978-0-521-51814-7. http://web4.cs.ucl.ac.uk/staff/D.Barber/pmwiki/pmwiki.php?n=Brml.HomePage. - ↑
^{7.0}^{7.1}^{7.2}^{7.3}^{7.4}^{7.5}Rasmussen, C.E.; Williams, C.K.I (2006).*Gaussian Processes for Machine Learning*. MIT Press. ISBN 978-0-262-18253-9. http://www.gaussianprocess.org/gpml/. - ↑ Grimmett, Geoffrey; David Stirzaker (2001).
*Probability and Random Processes*. Oxford University Press. ISBN 978-0198572220. - ↑ Seeger, Matthias (2004). "Gaussian Processes for Machine Learning".
*International Journal of Neural Systems***14**(2): 69–104. doi:10.1142/s0129065704001899. PMID 15112367. - ↑ Dudley, R. M. (1975). "The Gaussian process and how to approach it".
*Proceedings of the International Congress of Mathematicians*.**2**. pp. 143–146. https://www.mathunion.org/fileadmin/ICM/Proceedings/ICM1974.2/ICM1974.2.ocr.pdf. - ↑ Dudley, R. M. (2010). "Sample Functions of the Gaussian Process".
*Selected Works of R.M. Dudley*.**1**. 66–103. doi:10.1007/978-1-4419-5821-1_13. ISBN 978-1-4419-5820-4. http://projecteuclid.org/euclid.aop/1176997026. - ↑ Talagrand, Michel (2014).
*Upper and lower bounds for stochastic processes: modern methods and classical problems*. Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge / A Series of Modern Surveys in Mathematics. Springer, Heidelberg. ISBN 978-3-642-54074-5. https://www.springer.com/gp/book/9783642540745. - ↑ Ledoux, Michel (1996), "Isoperimetry and Gaussian analysis", in Dobrushin, Roland; Groeneboom, Piet; Ledoux, Michel,
*Lectures on Probability Theory and Statistics: Ecole d'Eté de Probabilités de Saint-Flour XXIV–1994*, Lecture Notes in Mathematics,**1648**, Berlin: Springer, pp. 165–294, doi:10.1007/BFb0095676, ISBN 978-3-540-62055-6 - ↑ Adler, Robert J. (1990).
*An Introduction to Continuity, Extrema, and Related Topics for General Gaussian Processes*.**12**. Hayward, California: Institute of Mathematical Statistics. ISBN 0-940600-17-X. - ↑ Berman, Simeon M. (1992). "Review of: Adler 1990 'An introduction to continuity...'".
*Mathematical Reviews*. - ↑
^{16.0}^{16.1}Dudley, R. M. (1967). "The sizes of compact subsets of Hilbert space and continuity of Gaussian processes".*Journal of Functional Analysis***1**(3): 290–330. doi:10.1016/0022-1236(67)90017-1. - ↑
^{17.0}^{17.1}Marcus, M.B.; Shepp, Lawrence A. (1972). "Sample behavior of Gaussian processes".*Proceedings of the sixth Berkeley symposium on mathematical statistics and probability, vol. II: probability theory*.**6**. Univ. California, Berkeley. pp. 423–441. https://projecteuclid.org/euclid.bsmsp/1200514231. - ↑
^{18.0}^{18.1}Marcus, Michael B.; Shepp, Lawrence A. (1970). "Continuity of Gaussian processes".*Transactions of the American Mathematical Society***151**(2): 377–391. doi:10.1090/s0002-9947-1970-0264749-1. - ↑ Driscoll, Michael F. (1973). "The reproducing kernel Hilbert space structure of the sample paths of a Gaussian process".
*Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete***26**(4): 309–316. doi:10.1007/BF00534894. ISSN 0044-3719. - ↑ Jidling, Carl; Wahlström, Niklas; Wills, Adrian; Schön, Thomas B. (2017-09-19). "Linearly constrained Gaussian processes". arXiv:1703.00787 [stat.ML].
- ↑ The documentation for scikit-learn also has similar examples.
- ↑ Liu, W.; Principe, J.C.; Haykin, S. (2010).
*Kernel Adaptive Filtering: A Comprehensive Introduction*.*John Wiley & Sons*. ISBN 978-0-470-44753-6. http://www.cnel.ufl.edu/~weifeng/publication.htm. Retrieved 2010-03-26. - ↑ Álvarez, Mauricio A.; Rosasco, Lorenzo; Lawrence, Neil D. (2012). "Kernels for vector-valued functions: A review".
*Foundations and Trends in Machine Learning***4**(3): 195–266. doi:10.1561/2200000036. http://eprints.whiterose.ac.uk/114503/1/1106.6251v2.pdf. - ↑ Chen, Zexun; Wang, Bo; Gorban, Alexander N. (2019). "Multivariate Gaussian and Student-t process regression for multi-output prediction".
*Neural Computing and Applications***32**(8): 3005–3028. doi:10.1007/s00521-019-04687-8. - ↑ Stein, M.L. (1999).
*Interpolation of Spatial Data: Some Theory for Kriging*. Springer. - ↑ Platanios, Emmanouil A.; Chatzis, Sotirios P. (2014). "Gaussian Process-Mixture Conditional Heteroscedasticity".
*IEEE Transactions on Pattern Analysis and Machine Intelligence***36**(5): 888–900. doi:10.1109/TPAMI.2013.183. PMID 26353224. - ↑ Chatzis, Sotirios P. (2013). "A latent variable Gaussian process model with Pitman–Yor process priors for multiclass classification".
*Neurocomputing***120**: 482–489. doi:10.1016/j.neucom.2013.04.029. - ↑ Griffiths, Ryan-Rhys (2022).
*Applications of Gaussian Processes at Extreme Lengthscales: From Molecules to Black Holes*(PhD thesis). University of Cambridge. arXiv:2303.14291. doi:10.17863/CAM.93643. - ↑ Smola, A.J.; Schoellkopf, B. (2000). "Sparse greedy matrix approximation for machine learning".
*Proceedings of the Seventeenth International Conference on Machine Learning*: 911–918. - ↑ Csato, L.; Opper, M. (2002). "Sparse on-line Gaussian processes".
*Neural Computation***14**(3): 641–668. doi:10.1162/089976602317250933. PMID 11860686. - ↑ Lee, Se Yoon; Mallick, Bani (2021). "Bayesian Hierarchical Modeling: Application Towards Production Results in the Eagle Ford Shale of South Texas".
*Sankhya B***84**: 1–43. doi:10.1007/s13571-020-00245-8. - ↑ Ranftl, Sascha; Melito, Gian Marco; Badeli, Vahid; Reinbacher-Köstinger, Alice; Ellermann, Katrin; von der Linden, Wolfgang (2019-12-31). "Bayesian Uncertainty Quantification with Multi-Fidelity Data and Gaussian Processes for Impedance Cardiography of Aortic Dissection".
*Entropy***22**(1): 58. doi:10.3390/e22010058. ISSN 1099-4300. PMID 33285833. Bibcode: 2019Entrp..22...58R. - ↑ Novak, Roman; Xiao, Lechao; Hron, Jiri; Lee, Jaehoon; Alemi, Alexander A.; Sohl-Dickstein, Jascha; Schoenholz, Samuel S. (2020). "Neural Tangents: Fast and Easy Infinite Neural Networks in Python".
*International Conference on Learning Representations*. - ↑ Neal, Radford M. (2012).
*Bayesian Learning for Neural Networks*. Springer Science and Business Media.

## External links

### Literature

- The Gaussian Processes Web Site, including the text of Rasmussen and Williams' Gaussian Processes for Machine Learning
- Ebden, Mark (2015). "Gaussian Processes: A Quick Introduction". arXiv:1505.02965 [math.ST].
- A Review of Gaussian Random Fields and Correlation Functions
- Efficient Reinforcement Learning using Gaussian Processes

### Software

- GPML: A comprehensive Matlab toolbox for GP regression and classification
- STK: a Small (Matlab/Octave) Toolbox for Kriging and GP modeling
- Kriging module in UQLab framework (Matlab)
- CODES Toolbox: implementations of Kriging, variational kriging and multi-fidelity models (Matlab)
- Matlab/Octave function for stationary Gaussian fields
- Yelp MOE – A black box optimization engine using Gaussian process learning
- ooDACE – A flexible object-oriented Kriging Matlab toolbox.
- GPstuff – Gaussian process toolbox for Matlab and Octave
- GPy – A Gaussian processes framework in Python
- GSTools - A geostatistical toolbox, including Gaussian process regression, written in Python
- Interactive Gaussian process regression demo
- Basic Gaussian process library written in C++11
- scikit-learn – A machine learning library for Python which includes Gaussian process regression and classification
- [1] - The Kriging toolKit (KriKit) is developed at the Institute of Bio- and Geosciences 1 (IBG-1) of Forschungszentrum Jülich (FZJ)

### Video tutorials

- Gaussian Process Basics by David MacKay
- Learning with Gaussian Processes by Carl Edward Rasmussen
- Bayesian inference and Gaussian processes by Carl Edward Rasmussen

Original source: https://en.wikipedia.org/wiki/Gaussian process.
Read more |