Bayesian computing with INLA: a review

Havard Rue, Andrea Riebler, Sigrunn H. Sørbye, Janine B. Illian, Daniel P. Simpson, Finn K. Lindgren

Research output: Contribution to journalReview ArticleResearchpeer-review

193 Citations (Scopus)

Abstract

The key operation in Bayesian inference is to compute high-dimensional integrals. An old approximate technique is the Laplace method or approximation, which dates back to Pierre-Simon Laplace (1774). This simple idea approximates the integrand with a second-order Taylor expansion around the mode and computes the integral analytically. By developing a nested version of this classical idea, combined with modern numerical techniques for sparse matrices, we obtain the approach of integrated nested Laplace approximations (INLA) to do approximate Bayesian inference for latent Gaussian models (LGMs). LGMs represent an important model abstraction for Bayesian inference and include a large proportion of the statistical models used today. In this review, we discuss the reasons for the success of the INLA approach, the R-INLA package, why it is so accurate, why the approximations are very quick to compute, and why LGMs make such a useful concept for Bayesian computing.

Original languageEnglish
Pages (from-to)395-421
Number of pages27
JournalAnnual Review of Statistics and Its Application
Volume4
DOIs
Publication statusPublished - 7 Mar 2017
Externally publishedYes

Keywords

  • Approximate Bayesian inference
  • Gaussian Markov random fields
  • Laplace approximations
  • Latent Gaussian models
  • Numerical integration
  • Sparse matrices

Cite this