We study the convergence rate of a class of linear multi-step methods for BSDEs. We show that, under a sufficient condition on the coefficients, the schemes enjoy a fundamental stability property. Coupling this result to an analysis of the truncation error allows us to design approximation with arbitrary order of convergence. Contrary to the analysis performed in \cite{zhazha10}, we consider general diffusion model and BSDEs with driver depending on $z$. The class of methods we consider contains well known methods from the ODE framework as Nystrom, Milne or Adams methods. We also study a class of Predictor-Correctot methods based on Adams methods. Finally, we provide a numerical illustration of the convergence of some methods.
In this paper, we study the qualitative behaviour of approximation schemes for Backward Stochastic Differential Equations (BSDEs) by introducing a new notion of numerical stability. For the Euler scheme, we provide sufficient conditions in the one-dimensional and multidimensional case to guarantee the numerical stability. We then perform a classical Von Neumann stability analysis in the case of a linear driver $f$ and exhibit necessary conditions to get stability in this case. Finally, we illustrate our results with numerical applications.
This article deals with the numerical resolution of Markovian backward stochastic differential equations (BSDEs) with drivers of quadratic growth with respect to $z$ and bounded terminal conditions. We first show some bound estimates on the process $Z$ and we specify the Zhang's path regularity theorem. Then we give a new time discretization scheme with a non uniform time net for such BSDEs and we obtain an explicit convergence rate for this scheme.
We take advantage of recent and new results on optimal quantization theory to improve the quadratic optimal quantization error bounds for backward stochastic differential equations (BSDE) and nonlinear filtering problems. For both problems, a first improvement relies on a Pythagoras like Theorem for quantized conditional expectation. While allowing for some locally Lipschitz functions conditional densities in nonlinear filtering, the analysis of the error brings into playing a new robustness result about optimal quantizers, the so-called distortion mismatch property: $L^r$-quadratic optimal qu…
In this paper we present a weak approximation scheme for BSDEs driven by a Wiener process and an (in)finite activity Poisson random measure with drivers that are general Lipschitz functionals of the solution of the BSDE. The approximating backward stochastic difference equations (BSΔEs) are driven by random walks that weakly approximate the given Wiener process and Poisson random measure. We establish the weak convergence to the solution of the BSDE and the numerical stability of the sequence of solutions of the BSΔEs. By way of illustration we analyse explicitly a scheme with discrete step-si…
We introduce a discrete time reflected scheme to solve doubly reflected Backward Stochastic Differential Equations with jumps (in short DRBSDEs), driven by a Brownian motion and an independent compensated Poisson process. As in Dumitrescu-Labart (2014), we approximate the Brownian motion and the Poisson process by two random walks, but contrary to this paper, we discretize directly the DRBSDE, without using a penalization step. This gives us a fully implementable scheme, which only depends on one parameter of approximation: the number of time steps $n$ (contrary to the scheme proposed in Dumit…
Two discretizations of a class of locally Lipschitz Markovian backward stochastic differential equations (BSDEs) are studied. The first is the classical Euler scheme which approximates a projection of the processes Z, and the second a novel scheme based on Malliavin weights which approximates the mariginals of the process Z directly. Extending the representation theorem of Ma and Zhang leads to advanced a priori estimates and stability results for this class of BSDEs. These estimates are then used to obtain competitive convergence rates for both schemes with respect to the number of points in …
The paper is directly motivated by the pricing of vulnerable European and American options in a general hazard process setup and a related study of the corresponding pre-default backward stochastic differential equations (BSDE) and pre-default reflected backward stochastic differential equations (RBSDE). We work with a generic filtration $\FF$ for which the martingale representation property is assumed to hold with respect to a square-integrable martingale $M$ and the goal of this work is of twofold. First, we aim to establish the well-posedness results and comparison theorems for a generalize…
We consider a class of multi-dimensional BSDEs on a finite time horizon (containing in particular Lipschitzian-quadratic BSDEs), whose terminal values are bounded as well as their corresponding Malliavin derivatives. We prove two results. The first one is an exponential integrability condition which determines when a BSDE in this class has a solution up to a given time horizon. In the second result, via an ordinary differential equation, we compute a minimum horizon up to which any BSDE of this class has a solution. The combination of these two results leads to a new scheme to solve quadratic …
In this paper we study different algorithms for backward stochastic differential equations (BSDE in short) basing on random walk framework for 1-dimensional Brownian motion. Implicit and explicit schemes for both BSDE and reflected BSDE are introduced. Then we prove the convergence of different algorithms and present simulation results for different types of BSDEs.
We propose a new probabilistic numerical scheme for fully nonlinear equation of Hamilton-Jacobi-Bellman (HJB) type associated to stochastic control problem, which is based on the Feynman-Kac representation in [12] by means of control randomization and backward stochastic differential equation with nonpositive jumps. We study a discrete time approximation for the minimal solution to this class of BSDE when the time step goes to zero, which provides both an approximation for the value function and for an optimal control in feedback form. We obtained a convergence rate without any ellipticity con…
We extend the branching process based numerical algorithm of Bouchard et al. [3], that is dedicated to semilinear PDEs (or BSDEs) with Lipschitz nonlinearity, to the case where the nonlinearity involves the gradient of the solution. As in [3], this requires a localization procedure that uses a priori estimates on the true solution, so as to ensure the well-posedness of the involved Picard iteration scheme, and the global convergence of the algorithm. When, the nonlinearity depends on the gradient, the later needs to be controlled as well. This is done by using a face-lifting procedure. Converg…
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 metho…
We establish upper bounds for the $L^p$-quantization error, p in (1, 2+d), induced by the recursive Markovian quantization of a d-dimensional diffusion discretized via the Euler scheme. We introduce a hybrid recursive quantization scheme, easier to implement in the high-dimensional framework, and establish upper bounds to the corresponding $L^p$-quantization error. To take advantage of these extensions, we propose a time discretization scheme and a recursive quantization-based discretization scheme associated to a reflected Backward Stochastic Differential Equation and estimate $L^p$-error bou…
We study the discrete-time approximation for solutions of quadratic forward back- ward stochastic differential equations (FBSDEs) driven by a Brownian motion and a jump process which could be dependent. Assuming that the generator has a quadratic growth w.r.t. the variable z and the terminal condition is bounded, we prove the convergence of the scheme when the number of time steps n goes to infinity. Our approach is based on the companion paper [15] and allows to get a convergence rate similar to that of schemes of Brownian FBSDEs.
In the present paper we address stochastic optimal control problems for a step process $(X,\mathbb{F})$ under a progressive enlargement of the filtration. The global information is obtained adding to the reference filtration $\mathbb{F}$ the point process $H=1_{[τ,+\infty)}$. Here $τ$ is a random time that can be regarded as the occurrence time of an external shock event. We study two classes of control problems, over $[0,T]$ and over the random horizon $[0,T \wedge τ]$. We solve these control problems following a dynamical approach based on a class of BSDEs driven by the jump measure $μ^ Z$ o…
We study a discrete time approximation scheme for the solution of a doubly reflected Backward Stochastic Differential Equation (DBBSDE in short) with jumps, driven by a Brownian motion and an independent compensated Poisson process. Moreover, we suppose that the obstacles are right continuous and left limited (RCLL) processes with predictable and totally inaccessible jumps and satisfy Mokobodski's condition. Our main contribution consists in the construction of an implementable numerical sheme, based on two random binomial trees and the penalization method, which is shown to converge to the so…
Deep numerical schemes for systems of Ergodic BSDEs with applications to regime-switching forward utilities
Laboratoire Manceau de Mathématiques & FR CNRS N o 2962, Institut du Risque et de l’Assurance, Le Mans Université（数学磨坊实验室 & CNRS 2962 号，风险与保险研究所，勒曼大学）；Laboratoire Analyse, Géométrie et Applications, UMR CNRS 7539, Université Sorbonne Paris Nord（分析、几何与应用实验室，CNRS 7539 号，巴黎北大学）
This paper is dedicated to solving high-dimensional coupled FBSDEs with non-Lipschitz diffusion coefficients numerically. Under mild conditions, we provided a posterior estimate of the numerical solution that holds for any time duration. This posterior estimate validates the convergence of the recently proposed Deep BSDE method. In addition, we developed a numerical scheme based on the Deep BSDE method and presented numerical examples in financial markets to demonstrate the high performance.
We study the convergence of a class of Runge-Kutta type schemes for backward stochastic differential equations (BSDEs) in a Markovian framework. The schemes belonging to the class under consideration benefit from a certain stability property. As a consequence, the overall rate of the convergence of these schemes is controlled by their local truncation error. The schemes are categorized by the number of intermediate stages implemented between consecutive partition time instances. We show that the order of the schemes matches the number $p$ of intermediate stages for $p\le3$. Moreover, we show t…
We consider a class of backward stochastic differential equations (BSDEs) driven by Brownian motion and Poisson random measure, and subject to constraints on the jump component. We prove the existence and uniqueness of the minimal solution for the BSDEs by using a penalization approach. Moreover, we show that under mild conditions the minimal solutions to these constrained BSDEs can be characterized as the unique viscosity solution of quasi-variational inequalities (QVIs), which leads to a probabilistic representation for solutions to QVIs. Such a representation in particular gives a new stoch…
In this paper, we study the mean-variance portfolio selection problem under partial information with drift uncertainty. First we show that the market model is complete even in this case while the information is not complete and the drift is uncertain. Then, the optimal strategy based on partial information is derived, which reduces to solving a related backward stochastic differential equation (BSDE). Finally, we propose an efficient numerical scheme to approximate the optimal portfolio that is the solution of the BSDE mentioned above. Malliavin calculus and the particle representation play im…
We propose a probabilistic numerical algorithm to solve Backward Stochastic Differential Equations (BSDEs) with nonnegative jumps, a class of BSDEs introduced in [9] for representing fully nonlinear HJB equations. In particular, this allows us to numerically solve stochastic control problems with controlled volatility, possibly degenerate. Our backward scheme, based on least-squares regressions, takes advantage of high-dimensional properties of Monte-Carlo methods, and also provides a parametric estimate in feedback form for the optimal control. A partial analysis of the error of the scheme is…
We propose a reformulation of the convergence theorem of monotone numerical schemes introduced by Zhang and Zhuo for viscosity solutions of path-dependent PDEs, which extends the seminal work of Barles and Souganidis on the viscosity solution of PDE. We prove the convergence theorem under conditions similar to those of the classical theorem in the work of Barles and Souganidis. These conditions are satisfied, to the best of our knowledge, by all classical monotone numerical schemes in the context of stochastic control theory. In particular, the paper provides a unified approach to prove the co…
In this paper, we propose a deep learning based numerical scheme for strongly coupled FBSDEs, stemming from stochastic control. It is a modification of the deep BSDE method in which the initial value to the backward equation is not a free parameter, and with a new loss function being the weighted sum of the cost of the control problem, and a variance term which coincides with the mean squared error in the terminal condition. We show by a numerical example that a direct extension of the classical deep BSDE method to FBSDEs, fails for a simple linear-quadratic control problem, and motivate why t…
A scheme for stabilizing stochastic approximation iterates by adaptively scaling the step sizes is proposed and analyzed. This scheme leads to the same limiting differential equation as the original scheme and therefore has the same limiting behavior, while avoiding the difficulties associated with projection schemes. The proof technique requires only that the limiting o.d.e. descend a certain Lyapunov function outside an arbitrarily large bounded set.
The aim of this paper is to study the behavior of the weighted empirical measures of the decreasing step Euler scheme of a one-dimensional diffusion process having multiple invariant measures. This situation can occur when the drift and the diffusion coefficient are vanish simultaneously. As a first step, we give a brief description of the Feller's classification of the one-dimensional process. We recall the concept of attractive and repulsive boundary point and introduce the concept of strongly repulsive point. That allows us to establish a classification of the ergodic behavior of the diffus…
Relying on the classical connection between Backward Stochastic Differential Equations (BSDEs) and non-linear parabolic partial differential equations (PDEs), we propose a new probabilistic learning scheme for solving high-dimensional semi-linear parabolic PDEs. This scheme is inspired by the approach coming from machine learning and developed using deep neural networks in Han and al. [32]. Our algorithm is based on a Picard iteration scheme in which a sequence of linear-quadratic optimisation problem is solved by means of stochastic gradient descent (SGD) algorithm. In the framework of a line…
We address the weak numerical solution of stochastic differential equations driven by independent Brownian motions (SDEs for short). This paper develops a new methodology to design adaptive strategies for determining automatically the step-sizes of the numerical schemes that compute the mean values of smooth functions of the solutions of SDEs. First, we introduce a general method for constructing variable step-size weak schemes for SDEs, which is based on controlling the match between the first conditional moments of the increments of the numerical integrator and the ones corresponding to an a…
Centre Borelli（博雷利中心）；École Normale Supérieure Paris-Saclay（巴黎-萨克lay高等师范学院）；CMAP（CMAP实验室）；École Polytechnique（巴黎综合理工学院）；Laboratoire IMS（IMS实验室）；CNRS（法国国家科学研究中心）；Université de Bordeaux（波尔多大学）
This paper studies fixed step-size stochastic approximation (SA) schemes, including stochastic gradient schemes, in a Riemannian framework. It is motivated by several applications, where geodesics can be computed explicitly, and their use accelerates crude Euclidean methods. A fixed step-size scheme defines a family of time-homogeneous Markov chains, parametrized by the step-size. Here, using this formulation, non-asymptotic performance bounds are derived, under Lyapunov conditions. Then, for any step-size, the corresponding Markov chain is proved to admit a unique stationary distribution, and…
We present an implicit Split-Step explicit Euler type Method (dubbed SSM) for the simulation of McKean-Vlasov Stochastic Differential Equations (MV-SDEs) with drifts of superlinear growth in space, Lipschitz in measure and non-constant Lipschitz diffusion coefficient. The scheme is designed to leverage the structure induced by the interacting particle approximation system, including parallel implementation and the solvability of the implicit equation. The scheme attains the classical $1/2$ root mean square error (rMSE) convergence rate in stepsize and closes the gap left by [18, "Simulation of…
