Laplace's approximation

Laplace's approximation provides an analytical expression for a posterior probability distribution by fitting a Gaussian distribution with a mean equal to the MAP solution and precision equal to the observed Fisher information. The approximation is justified by the Bernstein–von Mises theorem, which states that, under regularity conditions, the error of the approximation tends to 0 as the number of data points tends to infinity.

For example, consider a regression or classification model with data set $\{x_n,y_n{\}}_{n=1,\dots ,N}$ comprising inputs $x$ and outputs $y$ with (unknown) parameter vector $\theta$ of length $D$. The likelihood is denoted $p(𝐲|𝐱,\theta )$ and the parameter prior $p(\theta )$. Suppose one wants to approximate the joint density of outputs and parameters $p(𝐲,\theta |𝐱)$. Bayes' formula reads:

$p(𝐲,\theta |𝐱)=p(𝐲|𝐱,\theta )p(\theta |𝐱)=p(𝐲|𝐱)p(\theta |𝐲,𝐱)\simeq \tilde{q}(\theta )=Zq(\theta ).$

The joint is equal to the product of the likelihood and the prior and by Bayes' rule, equal to the product of the marginal likelihood $p(𝐲|𝐱)$ and posterior $p(\theta |𝐲,𝐱)$. Seen as a function of $\theta$ the joint is an un-normalised density.

In Laplace's approximation, we approximate the joint by an un-normalised Gaussian $\tilde{q}(\theta )=Zq(\theta )$, where we use $q$ to denote approximate density, $\tilde{q}$ for un-normalised density and $Z$ the normalisation constant of $\tilde{q}$ (independent of $\theta$). Since the marginal likelihood $p(𝐲|𝐱)$ doesn't depend on the parameter $\theta$ and the posterior $p(\theta |𝐲,𝐱)$ normalises over $\theta$ we can immediately identify them with $Z$ and $q(\theta )$ of our approximation, respectively.

Laplace's approximation is

$p(𝐲,\theta |𝐱)\simeq p(𝐲,\hat{\theta }|𝐱)\exp (-\frac{1}{2}(\theta -\hat{\theta }{)}^{\mathrm{\top }}{S}^{-1}(\theta -\hat{\theta }))=\tilde{q}(\theta ),$

where we have defined

$\begin{array}{cc}\hat{\theta }& ={\mathrm{argmax}}_{\theta }\log p(𝐲,\theta |𝐱),\\ S^{-1}& =-{{\mathrm{\nabla }}_{\theta }{\mathrm{\nabla }}_{\theta }\log p(𝐲,\theta |𝐱)|}_{\theta =\hat{\theta }},\end{array}$

where $\hat{\theta }$ is the location of a mode of the joint target density, also known as the maximum a posteriori or MAP point and $S^{-1}$ is the $D\times D$ positive definite matrix of second derivatives of the negative log joint target density at the mode $\theta =\hat{\theta }$. Thus, the Gaussian approximation matches the value and the log-curvature of the un-normalised target density at the mode. The value of $\hat{\theta }$ is usually found using a gradient based method.

In summary, we have

$\begin{array}{cc}q(\theta )& =𝒩(\theta |\mu =\hat{\theta },\mathrm{\Sigma }=S),\\ \log Z& =\log p(𝐲,\hat{\theta }|𝐱)+\frac{1}{2}\log |S|+\frac{D}{2}\log (2\pi ),\end{array}$

for the approximate posterior over $\theta$ and the approximate log marginal likelihood respectively.

The main weaknesses of Laplace's approximation are that it is symmetric around the mode and that it is very local: the entire approximation is derived from properties at a single point of the target density. Laplace's method is widely used and was pioneered in the context of neural networks by David MacKay, and for Gaussian processes by Williams and Barber.

Further reading

• Template:Cite book
• Template:Cite book