REVIEW 3 cited by
Solving the Kolmogorov PDE by means of deep learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
Stochastic differential equations (SDEs) and the Kolmogorov partial differential equations (PDEs) associated to them have been widely used in models from engineering, finance, and the natural sciences. In particular, SDEs and Kolmogorov PDEs, respectively, are highly employed in models for the approximative pricing of financial derivatives. Kolmogorov PDEs and SDEs, respectively, can typically not be solved explicitly and it has been and still is an active topic of research to design and analyze numerical methods which are able to approximately solve Kolmogorov PDEs and SDEs, respectively. Nearly all approximation methods for Kolmogorov PDEs in the literature suffer under the curse of dimensionality or only provide approximations of the solution of the PDE at a single fixed space-time point. In this paper we derive and propose a numerical approximation method which aims to overcome both of the above mentioned drawbacks and intends to deliver a numerical approximation of the Kolmogorov PDE on an entire region $[a,b]^d$ without suffering from the curse of dimensionality. Numerical results on examples including the heat equation, the Black-Scholes model, the stochastic Lorenz equation, and the Heston model suggest that the proposed approximation algorithm is quite effective in high dimensions in terms of both accuracy and speed.
Forward citations
Cited by 3 Pith papers
-
Deep neural network approximations for Monte Carlo algorithms
A general theorem shows that neural networks inherit the absence of the curse of dimensionality from any discrete Monte Carlo scheme they can emulate, with applications to Kolmogorov PDEs.
-
Space-time error estimates for deep neural network approximations for differential equations
The paper proves the first space-time error estimates for deep ReLU network approximations of Euler approximations of perturbed differential equations.
-
PDE-DKL: PDE-constrained deep kernel learning in high dimensionality
A neural network compresses high-dimensional PDE coordinates into a low-dimensional latent space, where a PDE-constrained Gaussian process achieves accurate solutions and uncertainty estimates on test problems up to 5...
Discussion (0). Continue with ORCID to comment.