Multilevel sequential Monte Carlo: Mean square error bounds under verifiable conditions
- Univ. of Bordeaux (France)
- National Univ. of Singapore (Singapore)
- Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
We consider the multilevel sequential Monte Carlo (MLSMC) method of Beskos et al. (Stoch. Proc. Appl. [to appear]). This technique is designed to approximate expectations w.r.t. probability laws associated to a discretization. For instance, in the context of inverse problems, where one discretizes the solution of a partial differential equation. The MLSMC approach is especially useful when independent, coupled sampling is not possible. Beskos et al. show that for MLSMC the computational effort to achieve a given error, can be less than independent sampling. In this article we significantly weaken the assumptions of Beskos et al., extending the proofs to non-compact state-spaces. The assumptions are based upon multiplicative drift conditions as in Kontoyiannis and Meyn (Electron. J. Probab. 10 [2005]: 61–123). The assumptions are verified for an example.
- Research Organization:
- Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States). Center for Nanophase Materials Sciences (CNMS)
- Sponsoring Organization:
- USDOE
- Grant/Contract Number:
- AC05-00OR22725
- OSTI ID:
- 1361332
- Journal Information:
- Stochastic Analysis and Applications, Vol. 35, Issue 3; ISSN 0736-2994
- Publisher:
- Taylor & FrancisCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Web of Science
Multilevel Monte Carlo in approximate Bayesian computation
|
journal | January 2019 |
Multilevel Monte Carlo in Approximate Bayesian Computation | preprint | January 2017 |
Similar Records
Multilevel sequential Monte Carlo samplers
Forward and inverse uncertainty quantification using multilevel Monte Carlo algorithms for an elliptic non-local equation