Adaptive multilevel Monte Carlo for probabilities

From MaRDI portal



Abstract: We consider the numerical approximation of mathbbP[GinOmega] where the d-dimensional random variable G cannot be sampled directly, but there is a hierarchy of increasingly accurate approximations GellellinmathbbN which can be sampled. The cost of standard Monte Carlo estimation scales poorly with accuracy in this setup since it compounds the approximation and sampling cost. A direct application of Multilevel Monte Carlo improves this cost scaling slightly, but returns sub-optimal computational complexities since estimation of the probability involves a discontinuous functional of Gell. We propose a general adaptive framework which is able to return the MLMC complexities seen for smooth or Lipschitz functionals of Gell. Our assumptions and numerical analysis are kept general allowing the methods to be used for a wide class of problems. We present numerical experiments on nested simulation for risk estimation, where G=mathbbE[X|Y] is approximated by an inner Monte Carlo estimate. Further experiments are given for digital option pricing, involving an approximation of a d-dimensional SDE.












This page was built for publication: Adaptive multilevel Monte Carlo for probabilities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096456)