arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1806.09754math.NAcs.NA
收藏

马尔可夫链模拟用于多层蒙特卡罗

Markov chain Simulation for Multilevel Monte Carlo

National University of Singapore(新加坡国立大学);University of Manchester(曼彻斯特大学)

Ajay Jasra, Kody Law, Yaxian Xu

AI总结:

本文提出利用马尔可夫链蒙特卡罗在多层蒙特卡罗框架下近似连续问题期望值的方法,通过分层离散化和合适的耦合策略降低计算成本。

摘要:

本文提出利用马尔可夫链蒙特卡罗在多层蒙特卡罗框架下近似连续问题期望值的方法,通过分层离散化和合适的耦合策略降低计算成本。

英文摘要:

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 exact 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 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑