Multilevel Monte Carlo algorithms for L\'{e}vy-driven SDEs with Gaussian correction
Steffen Dereich

TL;DR
This paper develops multilevel Monte Carlo algorithms for efficiently computing expectations of functionals of solutions to Lévy-driven SDEs, utilizing Gaussian approximations for small jumps and analyzing error bounds based on Lévy measure properties.
Contribution
It introduces a novel multilevel Monte Carlo method combining jump simulation with Gaussian approximation, providing explicit error bounds linked to the Lévy measure's behavior.
Findings
Error bounds depend on the Blumenthal–Getoor index of the Lévy process.
The algorithm outperforms non-Gaussian approaches when the Blumenthal–Getoor index exceeds one.
Error order varies with the Lévy process's characteristics, achieving at most 1/6 order.
Abstract
We introduce and analyze multilevel Monte Carlo algorithms for the computation of , where is the solution of a multidimensional L\'{e}vy-driven stochastic differential equation and is a real-valued function on the path space. The algorithm relies on approximations obtained by simulating large jumps of the L\'{e}vy process individually and applying a Gaussian approximation for the small jump part. Upper bounds are provided for the worst case error over the class of all measurable real functions that are Lipschitz continuous with respect to the supremum norm. These upper bounds are easily tractable once one knows the behavior of the L\'{e}vy measure around zero. In particular, one can derive upper bounds from the Blumenthal--Getoor index of the L\'{e}vy process. In the case where the Blumenthal--Getoor index is larger than one, this approach…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
