Sequential Monte Carlo on large binary sampling spaces

From MaRDI portal
Publication:746260

DOI10.1007/S11222-011-9299-ZzbMATH Open1322.62035arXiv1101.6037OpenAlexW2100404003MaRDI QIDQ746260FDOQ746260

Nicolas Chopin, Christian Schäfer

Publication date: 16 October 2015

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

Abstract: A Monte Carlo algorithm is said to be adaptive if it automatically calibrates its current proposal distribution using past simulations. The choice of the parametric family that defines the set of proposal distributions is critical for good performance. In this paper, we present such a parametric family for adaptive sampling on high-dimensional binary spaces. A practical motivation for this problem is variable selection in a linear regression context. We want to sample from a Bayesian posterior distribution on the model space using an appropriate version of Sequential Monte Carlo. Raw versions of Sequential Monte Carlo are easily implemented using binary vectors with independent components. For high-dimensional problems, however, these simple proposals do not yield satisfactory results. The key to an efficient adaptive algorithm are binary parametric families which take correlations into account, analogously to the multivariate normal distribution on continuous spaces. We provide a review of models for binary data and make one of them work in the context of Sequential Monte Carlo sampling. Computational studies on real life data with about a hundred covariates suggest that, on difficult instances, our Sequential Monte Carlo approach clearly outperforms standard techniques based on Markov chain exploration.


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





Cites Work


Cited In (36)

Uses Software






This page was built for publication: Sequential Monte Carlo on large binary sampling spaces

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