OpenAlex ·
Efficient model exploration with the integrated nested Laplace approximation
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.07283
- Original
- Read it at the publisher
- Topics
Abstract
Model and variable selection are important topics in Bayesian inference. In particular, the selection of different fixed, random effects and hyperparameters in hierarchical models can be difficult because of their complex structure. In this paper, we introduce the use of approximate Bayesian inference for model and variable selection for hierarchical Bayesian models. The approach is based on the application of Markov chain Monte Carlo methods on the model space. In particular, the Metropolis-Hastings algorithm is used to sample from the set of model indices. In this way, the marginal likelihood is used to compute the acceptance probability so that it is not required to estimate the parameter models directly. For this, the integrated nested Laplace approximation (INLA) is used because it provides accurate estimates of the marginal likelihood and it can also provide estimates of the posterior marginal of the model parameters. This method can be applied not only to variable selection but to a wide range of problems subject to model uncertainty. To illustrate the potential of this approach, examples on variable selection, changepoint models and log-Gaussian Cox processes are developed.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Artificial Intelligence
Learning Adaptive SED for heterogeneous load balancing
Variance-Optimal Hedging in the Rough Hawkes--Heston Model
Accelerated High-Accuracy Sampling from a Warm Start via the Proximal Bouncy Particle Sampler
High-Magnetization Sampling at Low Temperatures: Ising Models and Bayesian Sparse Linear Regression
Almost Sharp Equivalence between Approximate Message Passing and Low-Degree Polynomials
Get the few papers worth your time in Artificial Intelligence every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.