Integrated nested Laplace approximations: Difference between revisions

From testwiki
Jump to navigation Jump to search
imported>OAbot
m Open access bot: hdl updated in citation with #oabot.
 
(No difference)

Latest revision as of 16:44, 6 November 2024

Template:Short description Template:Bayesian statistics Integrated nested Laplace approximations (INLA) is a method for approximate Bayesian inference based on Laplace's method.[1] It is designed for a class of models called latent Gaussian models (LGMs), for which it can be a fast and accurate alternative for Markov chain Monte Carlo methods to compute posterior marginal distributions.[2][3][4] Due to its relative speed even with large data sets for certain problems and models, INLA has been a popular inference method in applied statistics, in particular spatial statistics, ecology, and epidemiology.[5][6][7] It is also possible to combine INLA with a finite element method solution of a stochastic partial differential equation to study e.g. spatial point processes and species distribution models.[8][9] The INLA method is implemented in the R-INLA R package.[10]

Latent Gaussian models

Let 𝒚=(y1,,yn) denote the response variable (that is, the observations) which belongs to an exponential family, with the mean μi (of yi) being linked to a linear predictor ηi via an appropriate link function. The linear predictor can take the form of a (Bayesian) additive model. All latent effects (the linear predictor, the intercept, coefficients of possible covariates, and so on) are collectively denoted by the vector 𝒙. The hyperparameters of the model are denoted by θ. As per Bayesian statistics, 𝒙 and θ are random variables with prior distributions.

The observations are assumed to be conditionally independent given 𝒙 and θ: π(𝒚|𝒙,θ)=iπ(yi|ηi,θ), where is the set of indices for observed elements of 𝒚 (some elements may be unobserved, and for these INLA computes a posterior predictive distribution). Note that the linear predictor η is part of 𝒙.

For the model to be a latent Gaussian model, it is assumed that 𝒙|θ is a Gaussian Markov Random Field (GMRF)[1] (that is, a multivariate Gaussian with additional conditional independence properties) with probability density π(𝒙|θ)|𝑸θ|1/2exp(12𝒙T𝑸θ𝒙), where 𝑸θ is a θ-dependent sparse precision matrix and |𝑸θ| is its determinant. The precision matrix is sparse due to the GMRF assumption. The prior distribution π(θ) for the hyperparameters need not be Gaussian. However, the number of hyperparameters, m=dim(θ), is assumed to be small (say, less than 15).

Approximate Bayesian inference with INLA

In Bayesian inference, one wants to solve for the posterior distribution of the latent variables 𝒙 and θ. Applying Bayes' theorem π(𝒙,θ|𝒚)=π(𝒚|𝒙,θ)π(𝒙|θ)π(θ)π(𝒚), the joint posterior distribution of 𝒙 and θ is given by π(𝒙,θ|𝒚)π(θ)π(𝒙|θ)iπ(yi|ηi,θ)π(θ)|𝑸θ|1/2exp(12𝒙T𝑸θ𝒙+ilog[π(yi|ηi,θ)]). Obtaining the exact posterior is generally a very difficult problem. In INLA, the main aim is to approximate the posterior marginals π(xi|𝒚)=π(xi|θ,𝒚)π(θ|𝒚)dθπ(θj|𝒚)=π(θ|𝒚)dθj, where θj=(θ1,,θj1,θj+1,,θm).

A key idea of INLA is to construct nested approximations given by π~(xi|𝒚)=π~(xi|θ,𝒚)π~(θ|𝒚)dθπ~(θj|𝒚)=π~(θ|𝒚)dθj, where π~(|) is an approximated posterior density. The approximation to the marginal density π(xi|𝒚) is obtained in a nested fashion by first approximating π(θ|𝒚) and π(xi|θ,𝒚), and then numerically integrating out θ as π~(xi|𝒚)=kπ~(xi|θk,𝒚)×π~(θk|𝒚)×Δk, where the summation is over the values of θ, with integration weights given by Δk. The approximation of π(θj|𝒚) is computed by numerically integrating θj out from π~(θ|𝒚).

To get the approximate distribution π~(θ|𝒚), one can use the relation π(θ|𝒚)=π(𝒙,θ,𝒚)π(𝒙|θ,𝒚)π(𝒚), as the starting point. Then π~(θ|𝒚) is obtained at a specific value of the hyperparameters θ=θk with Laplace's approximation[1] π~(θk|𝒚)π(𝒙,θk,𝒚)π~G(𝒙|θk,𝒚)|𝒙=𝒙*(θk),π(𝒚|𝒙,θk)π(𝒙|θk)π(θk)π~G(𝒙|θk,𝒚)|𝒙=𝒙*(θk), where π~G(𝒙|θk,𝒚) is the Gaussian approximation to π(𝒙|θk,𝒚) whose mode at a given θk is 𝒙*(θk). The mode can be found numerically for example with the Newton-Raphson method.

The trick in the Laplace approximation above is the fact that the Gaussian approximation is applied on the full conditional of 𝒙 in the denominator since it is usually close to a Gaussian due to the GMRF property of 𝒙. Applying the approximation here improves the accuracy of the method, since the posterior π(θ|𝒚) itself need not be close to a Gaussian, and so the Gaussian approximation is not directly applied on π(θ|𝒚). The second important property of a GMRF, the sparsity of the precision matrix 𝑸θk, is required for efficient computation of π~(θk|𝒚) for each value θk.[1]

Obtaining the approximate distribution π~(xi|θk,𝒚) is more involved, and the INLA method provides three options for this: Gaussian approximation, Laplace approximation, or the simplified Laplace approximation.[1] For the numerical integration to obtain π~(xi|𝒚), also three options are available: grid search, central composite design, or empirical Bayes.[1]

References

Template:Reflist

Further reading