Multilevel sequential Monte Carlo: Mean square error bounds under verifiable conditions - Archive ouverte HAL Access content directly
Journal Articles Stochastic Analysis and Applications Year : 2016

Multilevel sequential Monte Carlo: Mean square error bounds under verifiable conditions

(1) , (2) , (3)
1
2
3

Abstract

In this article, we consider the multilevel sequential Monte Carlo (MLSMC) method of Beskos et al. (Stoch. Proc. Appl. [to appear]). This is a technique 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.

Dates and versions

hal-01669155 , version 1 (20-12-2017)

Identifiers

Cite

Pierre del Moral, Ajay Jasra, Kody J. H. Law. Multilevel sequential Monte Carlo: Mean square error bounds under verifiable conditions. Stochastic Analysis and Applications, 2016, 35 (3), pp.478 - 498. ⟨10.1080/07362994.2016.1272421⟩. ⟨hal-01669155⟩
54 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More