INLA
Integrated Nested Laplace Approximation — a fast, deterministic alternative to MCMC for a broad class of Bayesian models, trading some generality for speed and reliable convergence.
Latent Gaussian model
What INLA avoids
Tradeoff
INLA (Integrated Nested Laplace Approximation) is a deterministic approximation method for Bayesian latent Gaussian models. Instead of simulating posterior samples like MCMC, INLA directly approximates the marginal posteriors people usually want:
Here is the observed data, is a high-dimensional latent field, and is a small vector of hyperparameters. INLA is fast because it uses the Gaussian structure of , sparse precision matrices, and Laplace approximations around posterior modes.
The tradeoff is structural: INLA is not a universal Bayesian engine. It is powerful when the model fits the latent Gaussian template, and much less natural when the hidden layer is not conditionally Gaussian.
A spatial disease-mapping model might observe counts in many regions and include an unobserved spatial risk for each region. Nearby regions are assumed to have similar risk, so the latent field is modeled with a sparse Gaussian precision matrix. MCMC may need a long run and convergence checks; INLA can often compute the region-level posterior marginals in seconds or minutes.
If MCMC is more general than INLA, why would anyone choose INLA over MCMC?
Solution
Because for latent Gaussian models, INLA targets the desired marginal posteriors directly and deterministically. There is no chain to tune, no burn-in period, and no Monte Carlo error. The price is that the answer is an approximation, and the method depends on the model having the right conditional Gaussian structure.
Related concepts
Needs first
Related