Importance Sampling: Intrinsic Dimension and Computational Cost
arXiv:1511.06196
Abstract
The basic idea of importance sampling is to use independent samples from a proposal measure in order to approximate expectations with respect to a target measure. It is key to understand how many samples are required in order to guarantee accurate approximations. Intuitively, some notion of distance between the target and the proposal should determine the computational cost of the method. A major challenge is to quantify this distance in terms of parameters or statistics that are pertinent for the practitioner. The subject has attracted substantial interest from within a variety of communities. The objective of this paper is to overview and unify the resulting literature by creating an overarching framework. A general theory is presented, with a focus on the use of importance sampling in Bayesian inverse problems and filtering.
arXiv commentStatistical Science
References in corpus (14)
- Central limit theorem for sequential Monte Carlo methods and its application to Bayesian inference
- Can local particle filters beat the curse of dimensionality?
- Bayesian inverse problems with Gaussian priors
- Likelihood-informed dimension reduction for nonlinear inverse problems
- Posterior Contraction Rates for the Bayesian Approach to Linear Ill-Posed Inverse Problems
- On the role of interaction in sequential Monte Carlo algorithms
- Posterior Consistency for Bayesian Inverse Problems through Stability and Regression Results
- Posterior convergence for approximated unknowns in non-Gaussian statistical inverse problems
- Bayesian Posterior Contraction Rates for Linear Severely Ill-posed Inverse Problems
- A Stable Particle Filter in High-Dimensions
- Posterior consistency and convergence rates for Bayesian inversion with hypoelliptic operators
- A simple scheme for the parallelization of particle filters and its application to the tracking of complex stochastic systems
- Sequential Monte Carlo Methods for High-Dimensional Inverse Problems: A case study for the Navier-Stokes equations
- Preconditioning the prior to overcome saturation in Bayesian inverse problems
Cited by in corpus (6)
- Effective Sample Size for Importance Sampling based on discrepancy measures
- Hessian-based adaptive sparse quadrature for infinite-dimensional Bayesian inverse problems
- On well-posedness of Bayesian data assimilation and inverse problems in Hilbert space
- Continuum Limit of Posteriors in Graph Bayesian Inverse Problems
- Quasi-Monte Carlo and Multilevel Monte Carlo Methods for Computing Posterior Expectations in Elliptic Inverse Problems
- Sequential Ensemble Transform for Bayesian Inverse Problems