Abstract

Model comparison for the purposes of selection, averaging, and validation is a problem found throughout statistics. Within the Bayesian paradigm, these problems all require the calculation of the posterior probabilities of models within a particular class. Substantial progress has been made in recent years, but difficulties remain in the implementation of existing schemes. This article presents adaptive sequential Monte Carlo (SMC) sampling strategies to characterize the posterior distribution of a collection of models, as well as the parameters of those models. Both a simple product estimator and a combination of SMC and a path sampling estimator are considered and existing theoretical results are extended to include the path sampling variant. A novel approach to the automatic specification of distributions within SMC algorithms is presented and shown to outperform the state of the art in this area. The performance of the proposed strategies is demonstrated via an extensive empirical study. Comparisons with state-of-the-art algorithms show that the proposed algorithms are always competitive, and often substantially superior to alternative techniques, at equal computational cost and considerably less application-specific implementation effort. Supplementary materials for this article are available online.

Highlights

  • Model comparison lies at the core of Bayesian decision theory (Robert, 2007) and has attracted considerable attention in recent decades

  • For the population MCMC (PMCMC) algorithm, 50, 000 iterations are performed for burn-in and another 10, 000 iterations are used for inference

  • In this example we focus on the comparison between SMC2 and PMCMC

Read more

Summary

Introduction

Model comparison lies at the core of Bayesian decision theory (Robert, 2007) and has attracted considerable attention in recent decades. Most approaches to the calculation of the required posterior model probabilities depend upon asymptotic arguments, the post-processing of outputs from Markov chain Monte Carlo (MCMC) algorithms operating on the space of a single model or using specially designed MCMC techniques that provide direct estimates of these quantities (e.g. Reversible Jump MCMC, RJMCMC; Green (1995)). More robust and efficient Monte Carlo algorithms have been established in recent years. Most studies have focused on their abilities to explore high dimensional and multimodal spaces. The application of these algorithms to Bayesian model comparison is less well studied. We describe the major contributions to the area and recent developments of particular relevance

Methods
Results
Discussion
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.