COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Signal Processing and Communications Lab Seminars > Adaptive Monte Carlo on multivariate binary sampling spaces

## Adaptive Monte Carlo on multivariate binary sampling spacesAdd to your list(s) Download to your calendar using vCal - Prof Nicolas Chopin, ENSAE
- Tuesday 12 October 2010, 14:15-15:15
- LR5, Engineering, Department of.
If you have a question about this talk, please contact Rachel Fogg. Authors: Christian SchÃ¤fer (CREST, CEREMADE ), Nicolas Chopin (CREST) A Monte Carlo algorithm is said to be adaptive if it can adjust automatically its current proposal distribution, using past simulations. The choice of the parametric family that defines the set of proposal distributions is critical for a good performance. We treat the problem of constructing such parametric families for adaptive sampling on multivariate binary spaces. A practical motivation for this problem is variable selection in a linear regression context, where we need to either find the best model, with respect to some criterion, or to sample from a Bayesian posterior distribution on the model space. In terms of adaptive algorithms, we focus on the Cross-Entropy (CE) method for optimisation, and the Sequential Monte Carlo (SMC) methods for sampling. Raw versions of both SMC and CE algorithms are easily implemented using binary vectors with independent components. However, for high-dimensional model choice problems, these straightforward proposals do not yields satisfactory results. The key to advanced adaptive algorithms are binary parametric families which take at least the linear dependencies between components into account. We review suitable multivariate binary models and make them work in the context of SMC and CE. Extensive computational studies on real life data with a hundred covariates seem to prove the necessity of more advanced binary families, to make adaptive Monte Carlo procedures efficient. Besides, our numerical results encourage the use of SMC and CE methods as alternatives to techniques based on Markov chain exploration. Paper available on arxiv: http://arxiv.org/abs/1008.0055 This talk is part of the Signal Processing and Communications Lab Seminars series. ## This talk is included in these lists:- All Talks (aka the CURE list)
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge University Engineering Department Talks
- Centre for Smart Infrastructure & Construction
- Chris Davis' list
- Featured lists
- Information Engineering Division seminar list
- Interested Talks
- LR5, Engineering, Department of
- School of Technology
- Signal Processing and Communications Lab Seminars
- Trust & Technology Initiative - interesting events
- bld31
- ndk22's list
- rp587
Note that ex-directory lists are not shown. |
## Other listsChinese Culture Events Type the title of a new list here Resistance in Russia and Eastern Europe## Other talksUK 7T travelling-head study: pilot results Metamaterials and the Science of Invisibility High-Dimensional Collocation for Lognormal Diffusion Problems Numerical solution of the radiative transfer equation with a posteriori error bounds An intellectual history of the universal basic income |