Type
ArticleAuthors
Jasra, Ajay
Law, Kody J. H.
Xu, Yaxian
KAUST Grant Number
CRG4 grant ref: 2584Date
2021Preprint Posting Date
2018-06-26Embargo End Date
2022-02-10Submitted Date
2020-10Permanent link to this record
http://hdl.handle.net/10754/661004
Metadata
Show full item recordAbstract
This paper considers a new approach to using Markov chain Monte Carlo (MCMC) in contexts where one may adopt multilevel (ML) Monte Carlo. The underlying problem is to approximate expectations w.r.t. an underlying probability measure that is associated to a continuum problem, such as a continuous-time stochastic process. It is then assumed that the associated probability measure can only be used (e.g. sampled) under a discretized approximation. In such scenarios, it is known that to achieve a target error, the computational effort can be reduced when using MLMC relative to i.i.d. sampling from the most accurate discretized probability. The ideas rely upon introducing hierarchies of the discretizations where less accurate approximations cost less to compute, and using an appropriate collapsing sum expression for the target expectation. If a suitable coupling of the probability measures in the hierarchy is achieved, then a reduction in cost is possible. This article focused on the case where exact sampling from such coupling is not possible. We show that one can construct suitably coupled MCMC kernels when given only access to MCMC kernels which are invariant with respect to each discretized probability measure. We prove, under verifiable assumptions, that this coupled MCMC approach in a ML context can reduce the cost to achieve a given error, relative to exact sampling. Our approach is illustrated on a numerical example.Citation
Jasra, A., Law, K. J. H., & Xu, Y. (2021). Markov chain simulation for multilevel Monte Carlo. Foundations of Data Science, 0–0. doi:10.3934/fods.2021004Sponsors
AJ was supported by an AcRF tier 2 grant: R-155-000-161-112. AJ is affiliated with the Risk Management Institute, the Center for Quantitative Finance and the OR & Analytics cluster at NUS. AJ was supported by a KAUST CRG4 grant ref: 2584. KJHL was supported by the University of Manchester School of Mathematics.Journal
Foundations of Data SciencearXiv
1806.09754Additional Links
https://www.aimsciences.org/article/doi/10.3934/fods.2021004ae974a485f413a2113503eed53cd6c53
10.3934/fods.2021004