Sequential Monte Carlo on large binary spaces

Christian Schäfer and Nicolas Chopin (both from CREST) just posted a new version of their paper, Sequential Monte Carlo on large binary sampling spaces, where they construct adaptive sequential algorithms for running variable selection with a large number of variables. The optimisation of their Gibbs scheme is thus over distributions exploring the set of the 2d possible configurations of the variable space, using a logistic regression to decide on the inclusion of the variables. The performances of the method are quite convincing! (The above is comparing their method (gold) with AMCMC (blue) and regular MCMC (red).) The code is available in Python.

One Response to “Sequential Monte Carlo on large binary spaces”

  1. […] of  [the applications] are primitive and artless“)  I was first very surprised to find sequential Monte Carlomentioned as well, but it later appeared this was Monte Carlo methods for sequential problems, in […]

Leave a Reply to A survey of [the 60's] Monte Carlo methods « Xi'an's Og Cancel reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.