Bayesian Computing with INLA: A Review

By Håvard Rue, Andrea Riebler, Sigrunn Holbek Sørbye, J. Illian, Daniel P. Simpson, Finn Lindgren. 2016

746 citations recorded by the source corpus.

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.

Subfields: Artificial Intelligence, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/94c449d8e6813fe7d47c97096535b7696bbaef8b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Daniel P. Simpson
  2. Aki Vehtari
  3. Andrew Gelman
  4. Håvard Rue
  5. Andrea Riebler
  6. Finn Lindgren
  7. Raphaël Huser
  8. Thomas Opitz

In Statistics and Probability

  1. Daniel P. Simpson
  2. Aki Vehtari
  3. Håvard Rue
  4. Andrea Riebler
  5. Andrew Gelman
  6. Finn Lindgren
  7. Paul-Christian Burkner
  8. Leonhard Held

Citations in the corpus