Bayesian interpretation of kernel regularization

Within bayesian statistics for machine learning, kernel methods arise from the assumption of an inner product space or similarity structure on inputs. For some such methods, such as support vector machines (SVMs), the original formulation and its regularization were not Bayesian in nature. It is helpful to understand them from a Bayesian perspective. Because the kernels are not necessarily positive semidefinite, the underlying structure may not be inner product spaces, but instead more general reproducing kernel Hilbert spaces. In Bayesian probability kernel methods are a key component of Gaussian processes, where the kernel function is known as the covariance function. Kernel methods have traditionally been used in supervised learning problems where the input space is usually a space of vectors while the output space is a space of scalars. More recently these methods have been extended to problems that deal with multiple outputs such as in multi-task learning.^[1]

A mathematical equivalence between the regularization and the Bayesian point of view is easily proved in cases where the reproducing kernel Hilbert space is finite-dimensional. The infinite-dimensional case raises subtle mathematical issues; we will consider here the finite-dimensional case. We start with a brief review of the main ideas underlying kernel methods for scalar learning, and briefly introduce the concepts of regularization and Gaussian processes. We then show how both points of view arrive at essentially equivalent estimators, and show the connection that ties them together.

The supervised learning problem

The classical supervised learning problem requires estimating the output for some new input point ${\displaystyle \mathbf {x} '}$  by learning a scalar-valued estimator ${\displaystyle {\hat {f}}(\mathbf {x} ')}$  on the basis of a training set ${\displaystyle S}$  consisting of ${\displaystyle n}$  input-output pairs, ${\displaystyle S=(\mathbf {X} ,\mathbf {Y} )=(\mathbf {x} _{1},y_{1}),\ldots ,(\mathbf {x} _{n},y_{n})}$ .^[2] Given a symmetric and positive bivariate function ${\displaystyle k(\cdot ,\cdot )}$  called a kernel, one of the most popular estimators in machine learning is given by

${\displaystyle {\hat {f}}(\mathbf {x} ')=\mathbf {k} ^{\top }(\mathbf {K} +\lambda n\mathbf {I} )^{-1}\mathbf {Y} ,}$

(1)

where ${\displaystyle \mathbf {K} \equiv k(\mathbf {X} ,\mathbf {X} )}$  is the kernel matrix with entries ${\displaystyle \mathbf {K} _{ij}=k(\mathbf {x} _{i},\mathbf {x} _{j})}$ , ${\displaystyle \mathbf {k} =[k(\mathbf {x} _{1},\mathbf {x} '),\ldots ,k(\mathbf {x} _{n},\mathbf {x} ')]^{\top }}$ , and ${\displaystyle \mathbf {Y} =[y_{1},\ldots ,y_{n}]^{\top }}$ . We will see how this estimator can be derived both from a regularization and a Bayesian perspective.

A regularization perspective

The main assumption in the regularization perspective is that the set of functions ${\displaystyle {\mathcal {F}}}$  is assumed to belong to a reproducing kernel Hilbert space ${\displaystyle {\mathcal {H}}_{k}}$ .^[2][3][4][5]

Reproducing kernel Hilbert space

A reproducing kernel Hilbert space (RKHS) ${\displaystyle {\mathcal {H}}_{k}}$  is a Hilbert space of functions defined by a symmetric, positive-definite function ${\displaystyle k:{\mathcal {X}}\times {\mathcal {X}}\rightarrow \mathbb {R} }$  called the reproducing kernel such that the function ${\displaystyle k(\mathbf {x} ,\cdot )}$  belongs to ${\displaystyle {\mathcal {H}}_{k}}$  for all ${\displaystyle \mathbf {x} \in {\mathcal {X}}}$ .^[6][7][8] There are three main properties make an RKHS appealing:

1. The reproducing property, which gives name to the space,

${\displaystyle f(\mathbf {x} )=\langle f,k(\mathbf {x} ,\cdot )\rangle _{k},\quad \forall \ f\in {\mathcal {H}}_{k},}$ 

where ${\displaystyle \langle \cdot ,\cdot \rangle _{k}}$  is the inner product in ${\displaystyle {\mathcal {H}}_{k}}$ .

2. Functions in an RKHS are in the closure of the linear combination of the kernel at given points,

${\displaystyle f(\mathbf {x} )=\sum _{i}k(\mathbf {x} _{i},\mathbf {x} )c_{i}}$ .

This allows the construction in a unified framework of both linear and generalized linear models.

3. The squared norm in an RKHS can be written as

${\displaystyle \|f\|_{k}^{2}=\sum _{i,j}k(\mathbf {x} _{i},\mathbf {x} _{j})c_{i}c_{j}}$ 

and could be viewed as measuring the complexity of the function.

The regularized functional

The estimator is derived as the minimizer of the regularized functional

${\displaystyle {\frac {1}{n}}\sum _{i=1}^{n}(f(\mathbf {x} _{i})-y_{i})^{2}+\lambda \|f\|_{k}^{2},}$

(2)

where ${\displaystyle f\in {\mathcal {H}}_{k}}$  and ${\displaystyle \|\cdot \|_{k}}$  is the norm in ${\displaystyle {\mathcal {H}}_{k}}$ . The first term in this functional, which measures the average of the squares of the errors between the ${\displaystyle f(\mathbf {x} _{i})}$  and the ${\displaystyle y_{i}}$ , is called the empirical risk and represents the cost we pay by predicting ${\displaystyle f(\mathbf {x} _{i})}$  for the true value ${\displaystyle y_{i}}$ . The second term in the functional is the squared norm in a RKHS multiplied by a weight ${\displaystyle \lambda }$  and serves the purpose of stabilizing the problem^[3][5] as well as of adding a trade-off between fitting and complexity of the estimator.^[2] The weight ${\displaystyle \lambda }$ , called the regularizer, determines the degree to which instability and complexity of the estimator should be penalized (higher penalty for increasing value of ${\displaystyle \lambda }$ ).

Derivation of the estimator

The explicit form of the estimator in equation (1) is derived in two steps. First, the representer theorem^[9][10][11] states that the minimizer of the functional (2) can always be written as a linear combination of the kernels centered at the training-set points,

${\displaystyle {\hat {f}}(\mathbf {x} ')=\sum _{i=1}^{n}c_{i}k(\mathbf {x} _{i},\mathbf {x} ')=\mathbf {k} ^{\top }\mathbf {c} ,}$

(3)

for some ${\displaystyle \mathbf {c} \in \mathbb {R} ^{n}}$ . The explicit form of the coefficients ${\displaystyle \mathbf {c} =[c_{1},\ldots ,c_{n}]^{\top }}$  can be found by substituting for ${\displaystyle f(\cdot )}$  in the functional (2). For a function of the form in equation (3), we have that

${\displaystyle {\begin{aligned}\|f\|_{k}^{2}&=\langle f,f\rangle _{k},\\&=\left\langle \sum _{i=1}^{N}c_{i}k(\mathbf {x} _{i},\cdot ),\sum _{j=1}^{N}c_{j}k(\mathbf {x} _{j},\cdot )\right\rangle _{k},\\&=\sum _{i=1}^{N}\sum _{j=1}^{N}c_{i}c_{j}\langle k(\mathbf {x} _{i},\cdot ),k(\mathbf {x} _{j},\cdot )\rangle _{k},\\&=\sum _{i=1}^{N}\sum _{j=1}^{N}c_{i}c_{j}k(\mathbf {x} _{i},\mathbf {x} _{j}),\\&=\mathbf {c} ^{\top }\mathbf {K} \mathbf {c} .\end{aligned}}}$ 

We can rewrite the functional (2) as

${\displaystyle {\frac {1}{n}}\|\mathbf {y} -\mathbf {K} \mathbf {c} \|^{2}+\lambda \mathbf {c} ^{\top }\mathbf {K} \mathbf {c} .}$ 

This functional is convex in ${\displaystyle \mathbf {c} }$  and therefore we can find its minimum by setting the gradient with respect to ${\displaystyle \mathbf {c} }$  to zero,

${\displaystyle {\begin{aligned}-{\frac {1}{n}}\mathbf {K} (\mathbf {Y} -\mathbf {K} \mathbf {c} )+\lambda \mathbf {K} \mathbf {c} &=0,\\(\mathbf {K} +\lambda n\mathbf {I} )\mathbf {c} &=\mathbf {Y} ,\\\mathbf {c} &=(\mathbf {K} +\lambda n\mathbf {I} )^{-1}\mathbf {Y} .\end{aligned}}}$ 

Substituting this expression for the coefficients in equation (3), we obtain the estimator stated previously in equation (1),

${\displaystyle {\hat {f}}(\mathbf {x} ')=\mathbf {k} ^{\top }(\mathbf {K} +\lambda n\mathbf {I} )^{-1}\mathbf {Y} .}$ 

A Bayesian perspective

The notion of a kernel plays a crucial role in Bayesian probability as the covariance function of a stochastic process called the Gaussian process.

A review of Bayesian probability

As part of the Bayesian framework, the Gaussian process specifies the prior distribution that describes the prior beliefs about the properties of the function being modeled. These beliefs are updated after taking into account observational data by means of a likelihood function that relates the prior beliefs to the observations. Taken together, the prior and likelihood lead to an updated distribution called the posterior distribution that is customarily used for predicting test cases.

The Gaussian process

A Gaussian process (GP) is a stochastic process in which any finite number of random variables that are sampled follow a joint Normal distribution.^[12] The mean vector and covariance matrix of the Gaussian distribution completely specify the GP. GPs are usually used as a priori distribution for functions, and as such the mean vector and covariance matrix can be viewed as functions, where the covariance function is also called the kernel of the GP. Let a function ${\displaystyle f}$  follow a Gaussian process with mean function ${\displaystyle m}$  and kernel function ${\displaystyle k}$ ,

${\displaystyle f\sim {\mathcal {GP}}(m,k).}$ 

In terms of the underlying Gaussian distribution, we have that for any finite set ${\displaystyle \mathbf {X} =\{\mathbf {x} _{i}\}_{i=1}^{n}}$  if we let ${\displaystyle f(\mathbf {X} )=[f(\mathbf {x} _{1}),\ldots ,f(\mathbf {x} _{n})]^{\top }}$  then

${\displaystyle f(\mathbf {X} )\sim {\mathcal {N}}(\mathbf {m} ,\mathbf {K} ),}$ 

where ${\displaystyle \mathbf {m} =m(\mathbf {X} )=[m(\mathbf {x} _{1}),\ldots ,m(\mathbf {x} _{N})]^{\top }}$  is the mean vector and ${\displaystyle \mathbf {K} =k(\mathbf {X} ,\mathbf {X} )}$  is the covariance matrix of the multivariate Gaussian distribution.

Derivation of the estimator

Further information: Minimum mean square error § Linear MMSE estimator for linear observation process

In a regression context, the likelihood function is usually assumed to be a Gaussian distribution and the observations to be independent and identically distributed (iid),

${\displaystyle p(y|f,\mathbf {x} ,\sigma ^{2})={\mathcal {N}}(f(\mathbf {x} ),\sigma ^{2}).}$ 

This assumption corresponds to the observations being corrupted with zero-mean Gaussian noise with variance ${\displaystyle \sigma ^{2}}$ . The iid assumption makes it possible to factorize the likelihood function over the data points given the set of inputs ${\displaystyle \mathbf {X} }$  and the variance of the noise ${\displaystyle \sigma ^{2}}$ , and thus the posterior distribution can be computed analytically. For a test input vector ${\displaystyle \mathbf {x} '}$ , given the training data ${\displaystyle S=\{\mathbf {X} ,\mathbf {Y} \}}$ , the posterior distribution is given by

${\displaystyle p(f(\mathbf {x} ')|S,\mathbf {x} ',{\boldsymbol {\phi }})={\mathcal {N}}(m(\mathbf {x} '),\sigma ^{2}(\mathbf {x} ')),}$ 

where ${\displaystyle {\boldsymbol {\phi }}}$  denotes the set of parameters which include the variance of the noise ${\displaystyle \sigma ^{2}}$  and any parameters from the covariance function ${\displaystyle k}$  and where

${\displaystyle {\begin{aligned}m(\mathbf {x} ')&=\mathbf {k} ^{\top }(\mathbf {K} +\sigma ^{2}\mathbf {I} )^{-1}\mathbf {Y} ,\\\sigma ^{2}(\mathbf {x} ')&=k(\mathbf {x} ',\mathbf {x} ')-\mathbf {k} ^{\top }(\mathbf {K} +\sigma ^{2}\mathbf {I} )^{-1}\mathbf {k} .\end{aligned}}}$ 

The connection between regularization and Bayes

A connection between regularization theory and Bayesian theory can only be achieved in the case of finite dimensional RKHS. Under this assumption, regularization theory and Bayesian theory are connected through Gaussian process prediction.^[3][12]

In the finite dimensional case, every RKHS can be described in terms of a feature map ${\displaystyle \Phi :{\mathcal {X}}\rightarrow \mathbb {R} ^{p}}$  such that^[2]

${\displaystyle k(\mathbf {x} ,\mathbf {x} ')=\sum _{i=1}^{p}\Phi ^{i}(\mathbf {x} )\Phi ^{i}(\mathbf {x} ').}$ 

Functions in the RKHS with kernel ${\displaystyle \mathbf {K} }$  can be then be written as

${\displaystyle f_{\mathbf {w} }(\mathbf {x} )=\sum _{i=1}^{p}\mathbf {w} ^{i}\Phi ^{i}(\mathbf {x} )=\langle \mathbf {w} ,\Phi (\mathbf {x} )\rangle ,}$ 

and we also have that

${\displaystyle \|f_{\mathbf {w} }\|_{k}=\|\mathbf {w} \|.}$ 

We can now build a Gaussian process by assuming ${\displaystyle \mathbf {w} =[w^{1},\ldots ,w^{p}]^{\top }}$  to be distributed according to a multivariate Gaussian distribution with zero mean and identity covariance matrix,

${\displaystyle \mathbf {w} \sim {\mathcal {N}}(0,\mathbf {I} )\propto \exp(-\|\mathbf {w} \|^{2}).}$ 

If we assume a Gaussian likelihood we have

${\displaystyle P(\mathbf {Y} |\mathbf {X} ,f)={\mathcal {N}}(f(\mathbf {X} ),\sigma ^{2}\mathbf {I} )\propto \exp \left(-{\frac {1}{\sigma ^{2}}}\|f_{\mathbf {w} }(\mathbf {X} )-\mathbf {Y} \|^{2}\right),}$ 

where ${\displaystyle f_{\mathbf {w} }(\mathbf {X} )=(\langle \mathbf {w} ,\Phi (\mathbf {x} _{1})\rangle ,\ldots ,\langle \mathbf {w} ,\Phi (\mathbf {x} _{n}\rangle )}$ . The resulting posterior distribution is the given by

${\displaystyle P(f|\mathbf {X} ,\mathbf {Y} )\propto \exp \left(-{\frac {1}{\sigma ^{2}}}\|f_{\mathbf {w} }(\mathbf {X} )-\mathbf {Y} \|_{n}^{2}+\|\mathbf {w} \|^{2}\right)}$ 

We can see that a maximum posterior (MAP) estimate is equivalent to the minimization problem defining Tikhonov regularization, where in the Bayesian case the regularization parameter is related to the noise variance.

From a philosophical perspective, the loss function in a regularization setting plays a different role than the likelihood function in the Bayesian setting. Whereas the loss function measures the error that is incurred when predicting ${\displaystyle f(\mathbf {x} )}$  in place of ${\displaystyle y}$ , the likelihood function measures how likely the observations are from the model that was assumed to be true in the generative process. From a mathematical perspective, however, the formulations of the regularization and Bayesian frameworks make the loss function and the likelihood function to have the same mathematical role of promoting the inference of functions ${\displaystyle f}$  that approximate the labels ${\displaystyle y}$  as much as possible.

See also

• Regularized least squares
• Bayesian linear regression
• Bayesian interpretation of Tikhonov regularization

References

1. Álvarez, Mauricio A.; Rosasco, Lorenzo; Lawrence, Neil D. (June 2011). "Kernels for Vector-Valued Functions: A Review". arXiv:1106.6251 [stat.ML].
2. Vapnik, Vladimir (1998). Statistical learning theory. Wiley. ISBN 9780471030034.
3. Wahba, Grace (1990). Spline models for observational data. SIAM.
4. Schölkopf, Bernhard; Smola, Alexander J. (2002). Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press. ISBN 9780262194754.
5. Girosi, F.; Poggio, T. (1990). "Networks and the best approximation property" (PDF). Biological Cybernetics. 63 (3). Springer: 169–176. doi:10.1007/bf00195855. hdl:1721.1/6017. S2CID 18824241.
6. Aronszajn, N (May 1950). "Theory of Reproducing Kernels". Transactions of the American Mathematical Society. 68 (3): 337–404. doi:10.2307/1990404. JSTOR 1990404.
7. Schwartz, Laurent (1964). "Sous-espaces hilbertiens d'espaces vectoriels topologiques et noyaux associés (noyaux reproduisants)". Journal d'Analyse Mathématique. 13 (1). Springer: 115–256. doi:10.1007/bf02786620. S2CID 117202393.
8. Cucker, Felipe; Smale, Steve (October 5, 2001). "On the mathematical foundations of learning". Bulletin of the American Mathematical Society. 39 (1): 1–49. doi:10.1090/s0273-0979-01-00923-5.
9. Kimeldorf, George S.; Wahba, Grace (1970). "A correspondence between Bayesian estimation on stochastic processes and smoothing by splines". The Annals of Mathematical Statistics. 41 (2): 495–502. doi:10.1214/aoms/1177697089.
10. Schölkopf, Bernhard; Herbrich, Ralf; Smola, Alex J. (2001). "A Generalized Representer Theorem". Computational Learning Theory. Lecture Notes in Computer Science. Vol. 2111/2001. pp. 416–426. doi:10.1007/3-540-44581-1_27. ISBN 978-3-540-42343-0.
11. De Vito, Ernesto; Rosasco, Lorenzo; Caponnetto, Andrea; Piana, Michele; Verri, Alessandro (October 2004). "Some Properties of Regularized Kernel Methods". Journal of Machine Learning Research. 5: 1363–1390.
12. Rasmussen, Carl Edward; Williams, Christopher K. I. (2006). Gaussian Processes for Machine Learning. The MIT Press. ISBN 0-262-18253-X.