ABC likelihood-free methods for model choice in Gibbs random fields

From MaRDI portal
Publication:5962444

DOI10.1214/09-BA412zbMATH Open1330.62126arXiv0807.2767WikidataQ60461489 ScholiaQ60461489MaRDI QIDQ5962444FDOQ5962444

Jean-Michel Marin, Christian Robert, Aude Grelaud, Jean-François Taly, François Rodolphe

Publication date: 12 February 2016

Published in: Bayesian Analysis (Search for Journal in Brave)

Abstract: Gibbs random fields (GRF) are polymorphous statistical models that can be used to analyse different types of dependence, in particular for spatially correlated data. However, when those models are faced with the challenge of selecting a dependence structure from many, the use of standard model choice methods is hampered by the unavailability of the normalising constant in the Gibbs likelihood. In particular, from a Bayesian perspective, the computation of the posterior probabilities of the models under competition requires special likelihood-free simulation techniques like the Approximate Bayesian Computation (ABC) algorithm that is intensively used in population genetics. We show in this paper how to implement an ABC algorithm geared towards model choice in the general setting of Gibbs random fields, demonstrating in particular that there exists a sufficient statistic across models. The accuracy of the approximation to the posterior probabilities can be further improved by importance sampling on the distribution of the models. The practical aspects of the method are detailed through two applications, the test of an iid Bernoulli model versus a first-order Markov chain, and the choice of a folding structure for two proteins.


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




Recommendations





Cited In (33)





This page was built for publication: ABC likelihood-free methods for model choice in Gibbs random fields

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