Publication | Open Access
Deep backward schemes for high-dimensional nonlinear PDEs
11
Citations
15
References
2019
Year
Model OptimizationEngineeringMachine LearningData ScienceLoss FunctionsMachine Learning ModelMultiphysics ModelingPde-constrained OptimizationPdes ResolutionRegularization (Mathematics)Physic Aware Machine LearningLarge Scale OptimizationInverse ProblemsComputer ScienceNonlinear Hyperbolic ProblemDeep LearningDeep Backward SchemesDeep Learning Schemes
The paper proposes new machine learning schemes to solve high‑dimensional nonlinear PDEs. The authors employ a BSDE‑based framework, training deep neural networks to jointly approximate the PDE solution and its gradient via recursively defined loss functions, and extend the approach to variational inequalities, providing convergence analysis and error bounds. Numerical experiments demonstrate accurate performance up to dimension 50 and beyond, matching recent methods when they converge, avoiding poor local minima and divergence, with the only limitation being neural network expressiveness for highly complex solutions.
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 \cite{weinan2017deep} 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 \cite{weinan2017deep}, 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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1