Adapted from an appendix of my MS thesis.
Covariance Functions
A covariance function encodes our assumptions about the function which we wish to learn. In supervised learning, the notion of similarity between data points is also crucial. It is a basic assumption that points and that are close are likely to have a similar target value . Under the Gaussian process view it is the covariance function that defines nearness or similarity [1].
A stationary covariance function is a function of . Thus it is invariant to translations in the input space. If further the covariance function is a function only of then it is called isotropic, and is thus invariant to all rigid motions. The squared exponential covariance function is isotropic. These functions are also known as radial basis functions (RBFs). Its formulation is as follows where is the characteristic length scale [1].
Furthermore, if a covariance function depends only on and through it is called a dot product covariance function. The linear covariance function is a special case of the dot product covariance function. The linear covariance function is written as follows where is constant [1].

Squared exponential covariance function — samples from a GP prior [2].

Linear covariance function — samples from a GP prior [2].

Matérn 5/2 kernel — samples from a GP prior [2].

Matérn 3/2 kernel — samples from a GP prior [2].

Exponential kernel — samples from a GP prior [2].

Polynomial kernel — samples from a GP prior [2].
A general name for a function of two arguments mapping a pair of inputs into is a kernel. A real kernel is said to be symmetric if . Covariance functions must be symmetric by definition [1].
References
- Rasmussen, Carl Edward, Williams, Christopher K. I. (2005) Gaussian Processes for Machine Learning. The MIT Press.
- Bill Engels, Oriol Abril Pla, Juan Orduz (2023) Mean and Covariance Functions. Zenodo.
Top comments (0)