Search arXivSearch

arXiv · 2410.09666

A forward scheme with machine learning for forward-backward SDEs with jumps by decoupling jumps

Abstract

Forward-backward stochastic differential equations (FBSDEs) have been generalized by introducing jumps for better capturing random phenomena, while the resulting FBSDEs are far more intricate than the standard one from every perspective. In this work, we establish a forward scheme for potentially high-dimensional FBSDEs with jumps, taking a similar approach to [Bender and Denk, 117 (2007), Stoch. Process. Their Appl., pp.1793-1812], with the aid of machine learning techniques for implementation. The developed forward scheme is built upon a recursive representation that decouples random jumps at every step and converges exponentially fast to the original FBSDE with jumps, often requiring only a few iterations to achieve sufficient accuracy, along with the error bound vanishing for lower jump intensities. The established framework also holds novelty in its neural network-based implementation of a wide class of forward schemes for FBSDEs, notably whether with or without jumps. We provide an extensive collection of numerical results, showcasing the effectiveness of the proposed recursion and its corresponding forward scheme in approximating high-dimensional FBSDEs with jumps (up to 100-dimension) without directly handling the random jumps.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Reiichiro Kawai, Riu Naito, Toshihiro Yamada. 2024-10-12. A forward scheme with machine learning for forward-backward SDEs with jumps by decoupling jumps. https://arxiv.org/abs/2410.09666

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA