Deep neural networks with ReLU, leaky ReLU, and softplus activation provably overcome the curse of dimensionality for space-time solutions of semilinear partial differential equations
Not on the map. Why?
Abstract (arXiv)
It is a challenging topic in applied mathematics to solve high-dimensional nonlinear partial differential equations (PDEs). Standard approximation methods for nonlinear PDEs suffer under the curse of dimensionality (COD) in the sense that the number of computational operations of the approximation method grows at least exponentially in the PDE dimension and with such methods it is essentially impossible to approximately solve high-dimensional PDEs even when the fastest currently available computers are used. However, in the last years great progress has been made in this area of research through suitable deep learning (DL) based methods for PDEs in which deep neural networks (DNNs) are used to approximate solutions of PDEs. Despite the remarkable success of such DL methods in simulations, it remains a fundamental open problem of research to prove (or disprove) that such methods can overcome the COD in the approximation of PDEs. However, there are nowadays several partial error analysis results for DL methods for high-dimensional nonlinear PDEs in the literature which prove that DNNs can overcome the COD in the sense that the number of parameters of the approximating DNN grows at most polynomially in both the reciprocal of the prescribed approximation accuracy varepsilon>0 and the PDE dimension d∈mathbbN. In the main result of this article we prove that for all T,p∈(0,∞) it holds that solutions udcolon[0,T]×ℝd→ℝ, d∈mathbbN, of semilinear heat equations with Lipschitz continuous nonlinearities can be approximated in the Lp-sense on space-time regions without the COD by DNNs with the rectified linear unit (ReLU), the leaky ReLU, or the softplus activation function. In previous articles similar results have been established not for space-time regions but for the solutions ud(T,·), d∈mathbbN, at the terminal time T.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 16 Jun 2024.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2024: 1; 2025: 3; 2026: 2.
6 papers.
- 2025A brief review of the Deep BSDE method for solving high-dimensional partial differential equationscited by 5
- 2024Multilevel Picard approximations and deep neural networks with ReLU, leaky ReLU, and softplus activation overcome the curse of dimensionality when approximating semilinear parabolic partial differential equations in Lp-sensecited by 3
- 2025Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionalitycited by 1
- 2025Error analysis for the deep Kolmogorov methodcited by 0
- 2026Walk-on-Spheres Monte Carlo and deep neural network approximations of elliptic PDEs with drift and killingcited by 0
- 2026Residual neural networks overcome the curse of dimensionality for semilinear heat equationscited by 0
- 2026Residual neural networks overcome the curse of dimensionality for semilinear heat equations3 Sep 2026
- 2026Walk-on-Spheres Monte Carlo and deep neural network approximations of elliptic PDEs with drift and killing10 Aug 2026
- 2025Error analysis for the deep Kolmogorov method23 Aug 2025
- 2025Deep neural networks can provably solve Bellman equations for Markov decision processes without the curse of dimensionality28 Jun 2025
- 2025A brief review of the Deep BSDE method for solving high-dimensional partial differential equations7 May 2025
- 2024Multilevel Picard approximations and deep neural networks with ReLU, leaky ReLU, and softplus activation overcome the curse of dimensionality when approximating semilinear parabolic partial differential equations in Lp-sense30 Sep 2024