Deep backward schemes for high-dimensional nonlinear PDEs
Not on the map. Why?
Abstract (arXiv)
We propose new machine learning schemes for solving high dimensional nonlinear partial differential equations (PDEs). Relying on the classical backward stochastic differential equation (BSDE) representation of PDEs, our algorithms estimate simultaneously the solution and its gradient by deep neural networks. These approximations are performed at each time step from the minimization of loss functions defined recursively by backward induction. The methodology is extended to variational inequalities arising in optimal stopping problems. We analyze the convergence of the deep learning schemes and provide error estimates in terms of the universal approximation of neural networks. Numerical results show that our algorithms give very good results till dimension 50 (and certainly above), for both PDEs and variational inequalities problems. For the PDEs resolution, our results are very similar to those obtained by the recent method in citeweinan2017deep when the latter converges to the right solution or does not diverge. Numerical tests indicate that the proposed methods are not stuck in poor local minimaas it can be the case with the algorithm designed in citeweinan2017deep, and no divergence is experienced. The only limitation seems to be due to the inability of the considered deep neural networks to represent a solution with a too complex structure in high dimension.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Feb 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 4; 2023: 1.
7 papers.
- 2021Policy Evaluation and Temporal-Difference Learning in Continuous Time and Space: A Martingale Approachcited by 62
- 2023NSGA-PINN: A Multi-Objective Optimization Method for Physics-Informed Neural Network Trainingcited by 13
- 2022Convergence of a robust deep FBSDE method for stochastic controlcited by 11
- 2022SympOCnet: Solving optimal control problems with applications to high-dimensional multi-agent path planning problemscited by 9
- 2021Neural network architectures using min-plus algebra for solving certain high dimensional optimal control problems and Hamilton-Jacobi PDEscited by 5
- 2022An application of the splitting-up method for the computation of a neural network representation for the solution for the filtering equationscited by 5
- 2022A deep learning approach to the probabilistic numerical solution of path-dependent partial differential equationscited by 2
- 2023NSGA-PINN: A Multi-Objective Optimization Method for Physics-Informed Neural Network Training3 Mar 2023
- 2022A deep learning approach to the probabilistic numerical solution of path-dependent partial differential equations28 Sep 2022
- 2022Convergence of a robust deep FBSDE method for stochastic control18 Jan 2022
- 2022SympOCnet: Solving optimal control problems with applications to high-dimensional multi-agent path planning problems14 Jan 2022
- 2022An application of the splitting-up method for the computation of a neural network representation for the solution for the filtering equations10 Jan 2022
- 2021Policy Evaluation and Temporal-Difference Learning in Continuous Time and Space: A Martingale Approach15 Aug 2021
- 2021Neural network architectures using min-plus algebra for solving certain high dimensional optimal control problems and Hamilton-Jacobi PDEs7 May 2021