Abstract
Implicit samplers are algorithms for producing independent, weighted samples from multivariate probability distributions. These are often applied in Bayesian data assimilation algorithms. We use Laplace asymptotic expansions to analyze two implicit samplers in the small noise regime. Our analysis suggests a symmetrization of the algorithms that leads to improved implicit sampling schemes at a relatively small additional cost. Computational experiments confirm the theory and show that symmetrization is effective for small noise sampling problems.
Original language | English (US) |
---|---|
Pages (from-to) | 1924-1951 |
Number of pages | 28 |
Journal | Communications on Pure and Applied Mathematics |
Volume | 69 |
Issue number | 10 |
DOIs | |
State | Published - Oct 1 2016 |
ASJC Scopus subject areas
- Mathematics(all)
- Applied Mathematics