Parallelized integrated nested Laplace approximations for fast Bayesian inference

From MaRDI portal
Publication:2677902

DOI10.1007/S11222-022-10192-1zbMATH Open1502.62016arXiv2204.04678OpenAlexW4312118372MaRDI QIDQ2677902FDOQ2677902


Authors: Lisa Gaedke-Merzhäuser, Olaf Schenk, Håvard Rue, Janet van Niekerk Edit this on Wikidata


Publication date: 9 January 2023

Published in: Statistics and Computing (Search for Journal in Brave)

Abstract: There is a growing demand for performing larger-scale Bayesian inference tasks, arising from greater data availability and higher-dimensional model parameter spaces. In this work we present parallelization strategies for the methodology of integrated nested Laplace approximations (INLA), a popular framework for performing approximate Bayesian inference on the class of Latent Gaussian models. Our approach makes use of nested OpenMP parallelism, a parallel line search procedure using robust regression in INLA's optimization phase and the state-of-the-art sparse linear solver PARDISO. We leverage mutually independent function evaluations in the algorithm as well as advanced sparse linear algebra techniques. This way we can flexibly utilize the power of today's multi-core architectures. We demonstrate the performance of our new parallelization scheme on a number of different real-world applications. The introduction of parallelism leads to speedups of a factor 10 and more for all larger models. Our work is already integrated in the current version of the open-source R-INLA package, making its improved performance conveniently available to all users.


Full work available at URL: https://arxiv.org/abs/2204.04678




Recommendations




Cites Work


Cited In (15)

Uses Software





This page was built for publication: Parallelized integrated nested Laplace approximations for fast Bayesian inference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2677902)