Generative Ornstein-Uhlenbeck Markets via Geometric Deep Learning
Not on the map. Why?
Abstract (arXiv)
We consider the problem of simultaneously approximating the conditional distribution of market prices and their log returns with a single machine learning model. We show that an instance of the GDN model of Kratsios and Papon (2022) solves this problem without having prior assumptions on the market's "clipped" log returns, other than that they follow a generalized Ornstein-Uhlenbeck process with a priori unknown dynamics. We provide universal approximation guarantees for these conditional distributions and contingent claims with a Lipschitz payoff function.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 3 of its 17 references that are in the map. First posted on arXiv 17 Feb 2023.
Builds on
3 of 17 references.
References · 3
- 2015Deep Kalman Filterscited by 163
- 2021Universal Approximation Theorems for Differentiable Geometric Deep Learningcited by 41
- 2022Designing Universal Causal Deep Learning Models: The Geometric (Hyper)Transformercited by 22
Built on by
Not cited yet.