Generative Modelling of L'evy Area for High Order SDE Simulation
Not on the map. Why?
Abstract (arXiv)
It is well understood that, when numerically simulating SDEs with general noise, achieving a strong convergence rate better than O(√h) (where h is the step size) requires the use of certain iterated integrals of Brownian motion, commonly referred to as its "L'evy areas". However, these stochastic integrals are difficult to simulate due to their non-Gaussian nature and for a d-dimensional Brownian motion with d > 2, no fast almost-exact sampling algorithm is known. In this paper, we propose L'evyGAN, a deep-learning-based model for generating approximate samples of L'evy area conditional on a Brownian increment. Due to our "Bridge-flipping" operation, the output samples match all joint and conditional odd moments exactly. Our generator employs a tailored GNN-inspired architecture, which enforces the correct dependency structure between the output distribution and the conditioning variable. Furthermore, we incorporate a mathematically principled characteristic-function based discriminator. Lastly, we introduce a novel training mechanism termed "Chen-training", which circumvents the need for expensive-to-generate training data-sets. This new training procedure is underpinned by our two main theoretical results. For 4-dimensional Brownian motion, we show that L'evyGAN exhibits state-of-the-art performance across several metrics which measure both the joint and marginal distributions. We conclude with a numerical experiment on the log-Heston model, a popular SDE in mathematical finance, demonstrating that high-quality synthetic L'evy area can lead to high order weak convergence and variance reduction when using multilevel Monte Carlo (MLMC).
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 9 of its 65 references that are in the map. First posted on arXiv 4 Aug 2023.
Builds on
9 of 65 references.
References · 9
- 2014Conditional Generative Adversarial Netscited by 2,152
- 2022On Neural Differential Equationscited by 264
- 2021Neural SDEs as Infinite-Dimensional GANscited by 159
- 2021Efficient and Accurate Gradients for Neural SDEscited by 68
- 2021Sig-Wasserstein GANs for Time Series Generationcited by 60
- 2019Stochastic Runge-Kutta Accelerates Langevin Monte Carlo and Beyondcited by 33
- 2019A Characteristic Function Approach to Deep Implicit Generative Modelingcited by 25
- 2023PCF-GAN: generating sequential data via the characteristic function of measures on the path spacecited by 13
- 2020Reciprocal Adversarial Learning via Characteristic Functionscited by 7
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 1.
3 papers.