Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Discretization and Machine Learning Approximation of BSDEs with a Constraint on the Gains-Process

Abstract : We study the approximation of backward stochastic differential equations (BSDEs for short) with a constraint on the gains process. We first discretize the constraint by applying a so-called facelift operator at times of a grid. We show that this discretely constrained BSDE converges to the continuously constrained one as the mesh grid converges to zero. We then focus on the approximation of the discretely constrained BSDE. For that we adopt a machine learning approach. We show that the facelift can be approximated by an optimization problem over a class of neural networks under constraints on the neural network and its derivative. We then derive an algorithm converging to the discretely constrained BSDE as the number of neurons goes to infinity. We end by numerical experiments. Mathematics Subject Classification (2010): 65C30, 65M75, 60H35, 93E20, 49L25.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02468354
Contributor : Thomas Lim <>
Submitted on : Wednesday, February 5, 2020 - 5:08:58 PM
Last modification on : Friday, April 10, 2020 - 5:27:02 PM
Document(s) archivé(s) le : Wednesday, May 6, 2020 - 5:36:47 PM

Files

ConstBSDENN.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02468354, version 1
  • ARXIV : 2002.02675

Citation

Idris Kharroubi, Thomas Lim, Xavier Warin. Discretization and Machine Learning Approximation of BSDEs with a Constraint on the Gains-Process. 2020. ⟨hal-02468354⟩

Share

Metrics

Record views

60

Files downloads

89