Pith. sign in

REVIEW

Deep Runge-Kutta schemes for BSDEs

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

arxiv 2212.14372 v1 pith:FDG2G5QN submitted 2022-12-29 math.NA cs.NAmath.PRq-fin.CP

classification math.NAcs.NAmath.PRq-fin.CP
keywords schemesdeepdifferentialequationsnumericalorderresultsrunge-kutta
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose a new probabilistic scheme which combines deep learning techniques with high order schemes for backward stochastic differential equations belonging to the class of Runge-Kutta methods to solve high-dimensional semi-linear parabolic partial differential equations. Our approach notably extends the one introduced in [Hure Pham Warin 2020] for the implicit Euler scheme to schemes which are more efficient in terms of discrete-time error. We establish some convergence results for our implemented schemes under classical regularity assumptions. We also illustrate the efficiency of our method for different schemes of order one, two and three. Our numerical results indicate that the Crank-Nicolson schemes is a good compromise in terms of precision, computational cost and numerical implementation.

Discussion (0). Continue with ORCID to comment.

Pith tools