Adaptive Multilevel Monte Carlo for Probabilities

Abdul-Lateef Haji-Ali, Jonathan Spence and Aretha Teckentrup

Papers from arXiv.org

Abstract: We consider the numerical approximation of $\mathbb{P}[G\in \Omega]$ where the $d$-dimensional random variable $G$ cannot be sampled directly, but there is a hierarchy of increasingly accurate approximations $\{G_\ell\}_{\ell\in\mathbb{N}}$ 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 $G_\ell$. We propose a general adaptive framework which is able to return the MLMC complexities seen for smooth or Lipschitz functionals of $G_\ell$. 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 = \mathbb{E}[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.

Date: 2021-07
New Economics Papers: this item is included in nep-cmp and nep-ore
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2107.09148 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2107.09148

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().