Mathematics – Statistics Theory
Scientific paper
2011-01-31
Mathematics
Statistics Theory
Scientific paper
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.
Chopin Nicolas
Schäfer Christian
No associations
LandOfFree
Sequential Monte Carlo on large binary sampling spaces does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Sequential Monte Carlo on large binary sampling spaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sequential Monte Carlo on large binary sampling spaces will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-648687