Approximate Bayesian inference for latent Gaussian models by using integrated nested Laplace approximations

被引:3405
作者
Rue, Havard [1 ]
Martino, Sara
Chopin, Nicolas [2 ,3 ]
机构
[1] Norwegian Univ Sci & Technol, Dept Math Sci, N-7491 Trondheim, Norway
[2] Ecole Natl Stat & Adm Econ, Paris, France
[3] Ctr Rech Econ & Stat, Paris, France
关键词
Approximate Bayesian inference; Gaussian Markov random fields; Generalized additive mixed models; Laplace approximation; Parallel computing; Sparse matrices; Structured additive regression models; STRUCTURED ADDITIVE REGRESSION; CHAIN MONTE-CARLO; MARKOV RANDOM-FIELDS; SPACE-TIME DATA; STOCHASTIC VOLATILITY; MAXIMUM-LIKELIHOOD; OPTIMAL-DESIGN; LINEAR-MODELS; COUNT DATA; BINARY;
D O I
10.1111/j.1467-9868.2008.00700.x
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Structured additive regression models are perhaps the most commonly used class of models in statistical applications. It includes, among others, (generalized) linear models, (generalized) additive models, smoothing spline models, state space models, semiparametric regression, spatial and spatiotemporal models, log-Gaussian Cox processes and geostatistical and geoadditive models. We consider approximate Bayesian inference in a popular subset of structured additive regression models, latent Gaussian models, where the latent field is Gaussian, controlled by a few hyperparameters and with non-Gaussian response variables. The posterior marginals are not available in closed form owing to the non-Gaussian response variables. For such models, Markov chain Monte Carlo methods can be implemented, but they are not without problems, in terms of both convergence and computational time. In some practical applications, the extent of these problems is such that Markov chain Monte Carlo sampling is simply not an appropriate tool for routine analysis. We show that, by using an integrated nested Laplace approximation and its simplified version, we can directly compute very accurate approximations to the posterior marginals. The main benefit of these approximations is computational: where Markov chain Monte Carlo algorithms need hours or days to run, our approximations provide more precise estimates in seconds or minutes. Another advantage with our approach is its generality, which makes it possible to perform Bayesian analysis in an automatic, streamlined way, and to compute model comparison criteria and various predictive measures so that models can be compared and the model under study can be challenged.
引用
收藏
页码:319 / 392
页数:74
相关论文
共 201 条
[1]   Approximate inference for disease mapping [J].
Ainsworth, L. M. ;
Dean, C. B. .
COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2006, 50 (10) :2552-2570
[2]   BAYESIAN-ANALYSIS OF BINARY AND POLYCHOTOMOUS RESPONSE DATA [J].
ALBERT, JH ;
CHIB, S .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1993, 88 (422) :669-679
[3]  
[Anonymous], P 9 IR STAT C DEP ST
[4]  
[Anonymous], 2 NORW U SCI TECHN D
[5]  
[Anonymous], THESIS U NEW S WALES
[6]  
[Anonymous], 1992, ANAL STAT BAYESIENNE
[7]  
[Anonymous], 1994, The Bayesian Choice
[8]  
Atkinson AC, 1998, J ROY STAT SOC B, V60, P521
[9]  
Attias H, 2000, ADV NEUR IN, V12, P209
[10]  
ATTIAS H, 1999, P 15 C UNC ART INT, V2, P21