Pith. sign in

REVIEW 1 major objections 6 minor 1 cited by

A brief review of the Deep BSDE method for solving high-dimensional partial differential equations

T0 review · 1 major / 6 minor · reviewed 2026-08-15 · deepseek-v4-flash

Pith's one-line read The Deep BSDE method recasts high-dimensional nonlinear PDEs as stochastic control problems solved by neural networks; this review argues it was the first method of its kind and surveys the field it started.

desk verdict A clean, useful review of Deep BSDE by its inventors; the math is fine, but the 'first' claim in the introduction is stronger than the evidence supports. read the letter →

arxiv 2505.17032 v1 pith:QUZ2SESJ submitted 2025-05-07 math.NA cs.CEcs.LGcs.NA

classification math.NAcs.CEcs.LGcs.NA MSC 65M7568T07
keywords DeepBSDEmethodhigh-dimensionalPDEsbackwardstochasticdifferentialequationscurseofdimensionalityneuralnetworkssemilinearparaboliccontrollearningfor
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This review argues that a particular reformulation—turning a semilinear parabolic PDE into a backward stochastic differential equation, then into a stochastic control problem—lets neural networks solve nonlinear PDEs in hundreds or even thousands of dimensions. The method, proposed in 2017, parameterizes the unknown solution and its gradient by feedforward networks, stacks one small subnetwork per time step, and trains by minimizing the squared mismatch between the network's terminal value and the PDE's terminal condition. The paper asserts that this was the first modern-deep-learning numerical method to effectively address general nonlinear high-dimensional PDEs, and it maps the subsequent wave of neural PDE solvers built on stochastic, least-squares, Ritz, and Galerkin formulations. A sympathetic reader would take away that the curse of dimensionality is not an absolute barrier once a stochastic representation and a trainable parameterization are both available.

What carries the argument

The load-bearing machinery is the BSDE reformulation of the PDE, specifically the identity $Y_t=u(t,X_t)$ and $Z_t=[\sigma(t,X_t)]^*\nabla_x u(t,X_t)$ for a solution $u$. This identity, combined with existence-and-uniqueness results for BSDEs, converts the PDE into a stochastic control problem: choose a starting value $Y_0$ and a process $Z_t$ so that the forwardly defined $Y_t$ ends at $g(X_T)$. The Deep BSDE method discretizes time, assigns one small feedforward subnetwork to each time step to represent $Z_t$, and trains the whole stacked residual network by stochastic gradient descent on the terminal-matching loss $\mathbb{E}|g(X_{t_N})-\hat u|^2$. Because the Brownian paths and initial condition are sampled rather than stored, the loss is defined without a pre-existing training set.

What would settle it

Choose a 100-dimensional semilinear parabolic PDE with a known solution and a nonlinear term $f$ that violates the Lipschitz-type conditions needed for the BSDE uniqueness results the review relies on. Run the Deep BSDE training, increasing network size and training steps, and compare the recovered $u(0,x_0)$ with the true value; if the error does not tend to zero, the method's validity outside the assumed equivalence regime is disproved.

Watch

Extended reading notes

Core claim

The paper's central claim is that the Deep BSDE method works. For a semilinear parabolic PDE of the form $\partial_t u+\mu\cdot\nabla_x u+\frac12\mathrm{Tr}(\sigma\sigma^*\,\mathrm{Hess}_x u)+f=0$, it uses the BSDE equivalence: with $X_t$ the forward diffusion, the pair $Y_t=u(t,X_t)$, $Z_t=[\sigma(t,X_t)]^*\nabla_x u(t,X_t)$ satisfies a backward equation, and uniqueness of the BSDE solution (from the cited existence-and-uniqueness theory) makes solving the PDE equivalent to minimizing $\mathbb{E}|g(X_T)-Y_T|^2$ over the starting value $Y_0$ and the control process $Z_t$. The review then describes how neural subnetworks $\psi_0,\phi_n$ parameterize $Y_0$ and $Z_t$, how the stacked subnetworks form a deep residual network, and how the terminal-matching loss uses paths generated on the fly, giving effectively infinite training data. It further claims this was the first numerical method based on modern deep learning to effectively solve general nonlinear PDEs in high dimensions, a statement the review treats as historically load-bearing, and it places the method as the seed of several later families of deep PDE solvers.

Load-bearing premise

The whole method rests on the assumption that the semilinear parabolic PDE and its associated backward stochastic differential equation are genuinely equivalent under the stated regularity conditions; if that equivalence fails, the mapping to a stochastic control problem collapses.

Editorial extensions

If this is right

  • For semilinear parabolic PDEs that admit the BSDE equivalence, the method returns numerical solutions in hundreds or even thousands of dimensions, a range traditional mesh-based methods cannot reach.
  • It gives a working algorithm for high-dimensional backward stochastic differential equations themselves, not just the PDEs they represent.
  • Several theoretical results cited in the review show that neural networks can approximate solutions of certain linear and semilinear high-dimensional PDEs with no curse of dimensionality: the number of parameters grows at most polynomially in the dimension and in the reciprocal of the target accuracy.
  • The same terminal-matching or residual-minimization idea reappears in least-squares methods (including physics-informed neural networks), the Deep Ritz method, and weak or Galerkin adversarial methods, so the original formulation seeded multiple research lines.
  • The review's own outlook places optimization error as the main unresolved piece: even for one-dimensional PDEs, a complete convergence proof for deep-learning PDE solvers is still open.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The review does not quantify how large the constant in the polynomial parameter growth is; if the implied constants are enormous, the practical value of the no-curse-of-dimensionality results could be limited even though the method works on benchmarks.
  • The review's priority claim invites a concrete historical test: since it cites 1990s least-squares neural PDE methods, a reader can check whether those earlier methods were indeed confined to low dimensions, which would sharpen or weaken the 'first' statement.
  • The method's reliance on stochastic gradient descent suggests a robustness check the review leaves open: run the same high-dimensional benchmark with different optimizers and random seeds and compare terminal losses; if the outcome varies wildly, the bottleneck is optimization rather than representation.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 6 minor

Summary. This manuscript is a short review of the Deep BSDE method for high-dimensional semilinear parabolic PDEs. It recalls the equivalence between such PDEs and backward stochastic differential equations, derives a variational/stochastic-control formulation, describes the neural-network discretization (forward Euler in time, terminal-condition loss), and surveys subsequent developments (BSDE-based schemes, PINNs/least-squares, Deep Ritz, weak adversarial networks) plus recent approximation and generalization theory. The abstract and Section 1 make the historical claim that Deep BSDE was the first numerical approach based on modern deep learning to effectively address general nonlinear PDEs in high dimensions; Section 4 outlines future directions in control, probabilistic modeling, quantum mechanics, kinetic equations, and theory.

Significance. If the historical priority claim is accepted, this is a useful concise reference: the mathematical summary is standard and essentially correct, the bibliography is comprehensive, and the paper explicitly acknowledges that full convergence analysis remains open. The review does not contain new proofs or numerical experiments, but it is a fair and compact exposition of the method. Its main weakness is that the 'first ... general nonlinear PDEs in high dimensions' claim is asserted rather than established; the mathematical content itself is not in question.

major comments (1)
  1. [Section 1, first paragraph (and the abstract)] The sentence 'This method was the first numerical approach based on modern deep learning to effectively address general nonlinear PDEs in high dimensions' is a central historical claim for this review, but it is made without comparative evidence. The same paragraph credits [35] as the first deep-learning method for high-dimensional stochastic control problems, and HJB equations are nonlinear PDEs; Section 3 also acknowledges early neural PDE solvers [21,56,60]. To make the claim defensible, please either (i) state explicit exclusion criteria (why the HJB class is not 'general nonlinear PDEs', what 'modern deep learning' excludes, and what quantitative threshold 'effectively' implies), or (ii) qualify the claim, e.g. 'to our knowledge' or 'within the semilinear parabolic class considered here'. As written, the priority claim is credible but unestablished, and the unsupported 'hundreds or even thousands' dimension claim would benefit from a few representative numbers from [24,40].
minor comments (6)
  1. [Section 2, final paragraph] The roles of the two networks are reversed: with the notation of (2.5), (2.10), and (2.12), psi approximates u(0,·) and phi approximates sigma^* grad u, so the deterministic-case sentence should read 'psi_0 = u(0, xi_0) and phi_0 = sigma(0, xi_0)^* grad_x u(0, xi_0)', not the converse.
  2. [Section 2, after (2.1)] The word 'euqations' in 'backward stochastic differential euqations' is a typo for 'equations'.
  3. [Section 3, methods based on least-squares and BSDEs] The text should read 'Feynman-Kac' rather than 'F eyman-Kac' and 'second-order BSDEs' rather than 'seconds order BSDEs'.
  4. [Section 2, variational formulation] The sentence 'The minimizer of this variational problem is the solution to the PDE and vice versa' is slightly overbroad without standard regularity/well-posedness assumptions; please add a parenthetical reference to the assumptions under which (2.4) has a unique solution.
  5. [Section 4, optimal control paragraph] The statement that the curse of dimensionality 'was originally coined' in this context needs a citation (standard attribution is to Bellman), or it should be softened.
  6. [References] Reference [39] ('Deep Picard iteration for high-dimensional nonlinear PDEs') is incomplete: it lacks a year and an arXiv or venue identifier.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the BSDE-to-PDE reduction rests on Itô's lemma and external Pardoux–Peng uniqueness results, and the Deep BSDE variational formulation is derived, not assumed.

full rationale

This is a short review rather than an original derivation, and the derivation chain it reports is self-contained with respect to standard external results. The mapping from the semilinear parabolic PDE (2.1) to the BSDE (2.4) is obtained by applying Itô's lemma (equation 2.3) and then invoking the uniqueness theory of Pardoux–Peng [72] and Pardoux–Tang [73]; neither of those citations is the authors' prior work. The variational problem (2.6)–(2.8) is then obtained from that equivalence by constructing Y_t forward from Y_0 and Z_t and matching the terminal condition g(X_T); by the cited uniqueness result, the minimizer is the BSDE solution, so the method's target is not equal to its input by construction. No fitted parameter is relabeled as a prediction, and the paper's mathematical content does not reduce to a self-citation chain. The heavy self-citation ([24], [35], [40]) concerns the historical origin and development of the method, but it is not used as logical evidence for the PDE–BSDE equivalence, and the numerical demonstrations in the cited original works are external benchmarks rather than consequences of the review's assertions. The paper also candidly acknowledges that a complete convergence analysis remains an open problem, which further indicates that it is not presenting a closed self-justifying argument. The priority claim that Deep BSDE was the first modern-deep-learning method to effectively address general nonlinear PDEs in high dimensions is asserted rather than systematically established against earlier work, but an unsubstantiated historical priority claim is a correctness or scholarship concern, not a circularity of the kind defined in this analysis. Therefore the appropriate circularity score is 0.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

The review relies on the standard BSDE theory and Itô calculus, which are introduced as known results. No free parameters or invented entities are introduced.

assumptions (3)
  • standard math Existence and uniqueness of solutions to the BSDE (2.4) is assumed, following Pardoux-Peng.
    The method relies on this to justify that solving the BSDE is equivalent to solving the PDE. It is a deep result of stochastic analysis, not proved in the review.
  • standard math Itô's lemma is used to derive (2.3) from the PDE.
    Standard stochastic calculus result that links the PDE to the BSDE.
  • domain assumption The PDE solution is regular enough for the stochastic representation to hold.
    The review states 'sufficiently regular functions' without further detail. This is a typical assumption for Feynman-Kac type representations.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A brief review of the Deep BSDE method for solving high-dimensional partial differential equations." pith.science (2026). https://pith.science/paper/QUZ2SESJ

@misc{pith2026250517032,
  author       = {Pith},
  title        = {Pith review of: A brief review of the Deep BSDE method for solving high-dimensional partial differential equations},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/QUZ2SESJ}},
  note         = {Machine review of arXiv:2505.17032}
}
read the original abstract

High-dimensional partial differential equations (PDEs) pose significant challenges for numerical computation due to the curse of dimensionality, which limits the applicability of traditional mesh-based methods. Since 2017, the Deep BSDE method has introduced deep learning techniques that enable the effective solution of nonlinear PDEs in very high dimensions. This innovation has sparked considerable interest in using neural networks for high-dimensional PDEs, making it an active area of research. In this short review, we briefly sketch the Deep BSDE method, its subsequent developments, and future directions for the field.

Figures

Figures reproduced from arXiv: 2505.17032 by the authors.

Figure 1
Figure 1. Network architecture for solving parabolic PDEs. Each column corre [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Finite-Agent Stochastic Differential Games on Large Graphs: II. Graph-Based Architectures

    cs.LG 2025-09 conditional novelty 5.0 of 10

    A graph-sparsified neural network, NTM, approximates Nash equilibrium strategies in stochastic differential games with far fewer trainable parameters and accuracy comparable to fully connected networks.

Reference graph

Works this paper leans on

84 extracted references · 66 canonical work pages · cited by 1 Pith paper

  1. [35]

    Deep learning approximation for stochastic control problems

    Han, J., and E, W. Deep learning approximation for stochastic control problems. Deep Reinforcement Learning Workshop, NIPS (2016)

  2. [1]

    Ackermann, J., Jentzen, A., Kuckuck, B., and Padgett, J. L. 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. arXiv preprint arXiv:2406.10876 (2024)

  3. [2]

    Drift Control of High-Dimensional RBM: A Computational Method Based on Neural Networks

    Ata, B., Harrison, J. M., and Si, N. Drift control of high-dimensional RBM: a computational method based on neural networks. arXiv preprint arXiv:2309.11651 (2023)

  4. [3]

    Deep splitting method for parabolic PDEs

    Beck, C., Becker, S., Cheridito, P., Jentzen, A., and Neufeld, A. Deep splitting method for parabolic PDEs. SIAM Journal on Scientific Computing 43, 5 (2021), A3135–A3154

  5. [4]

    Solv- ing the Kolmogorov PDE by means of deep learning

    Beck, C., Becker, S., Grohs, P., Jaafari, N., and Jentzen, A. Solv- ing the Kolmogorov PDE by means of deep learning. J. Sci. Comput. 88 , 3 (2021), Paper No. 73, 28

  6. [5]

    Machine learning approximation algo- rithms for high-dimensional fully nonlinear partial differential equations and second-order backward stochastic differential equations

    Beck, C., E, W., and Jentzen, A. Machine learning approximation algo- rithms for high-dimensional fully nonlinear partial differential equations and second-order backward stochastic differential equations. Journal of Nonlinear Science 29, 4 (2019), 1563–1619

  7. [6]

    An overview on deep learning-based approximation methods for partial differen- tial equations

    Beck, C., Hutzenthaler, M., Jentzen, A., and Kuckuck, B. An overview on deep learning-based approximation methods for partial differen- tial equations. Discrete Contin. Dyn. Syst. Ser. B 28 , 6 (2023), 3697–3746

  8. [7]

    Pricing and hedging American-style options with deep learning

    Becker, S., Cheridito, P., and Jentzen, A. Pricing and hedging American-style options with deep learning. Journal of Risk and Financial Management 13, 7 (2020), 158. Deep BSDE method 9

Show all 84 references
  1. [8]

    Numerically solving para- metric families of high-dimensional Kolmogorov partial differential equations via deep learning

    Berner, J., Dablander, M., and Grohs, P. Numerically solving para- metric families of high-dimensional Kolmogorov partial differential equations via deep learning. arXiv:2011.04602 (2020)

  2. [9]

    Berner, J., Grohs, P., and Jentzen, A. Analysis of the generalization error: empirical risk minimization over deep artificial neural networks over- comes the curse of dimensionality in the numerical approximation of Black- Scholes partial differential equations. SIAM J. Math. ...

  3. [10]

    From Monte Carlo to neural networks approximations of boundary value problems

    Beznea, L., Cimpean, I., Lupascu-Stamate, O., Popescu, I., and Zarnescu, A. From Monte Carlo to neural networks approximations of boundary value problems. arXiv preprint arXiv:2209.01432 (2024)

  4. [11]

    Blechschmidt, J., and Ernst, O. G. Three ways to solve partial differ- ential equations with neural network—a review. GAMM-Mitt. 44 , 2 (2021), Paper No. e202100006, 29

  5. [12]

    M., and Vanden-Eijnden, E

    Boffi, N. M., and Vanden-Eijnden, E. Deep learning probability flows and entropy production rates in active matter. Proceedings of the National Academy of Sciences 121 , 25 (2024), e2318106121

  6. [13]

    Solving the quantum many-body problem with artificial neural networks

    Carleo, G., and Troyer, M. Solving the quantum many-body problem with artificial neural networks. Science 355, 6325 (2017), 602–606

  7. [14]

    Convergence analysis of machine learning algorithms for the numerical solution of mean field control and games I: The ergodic case

    Carmona, R., and Lauri`ere, M. Convergence analysis of machine learning algorithms for the numerical solution of mean field control and games I: The ergodic case. SIAM Journal on Numerical Analysis 59 , 3 (2021), 1455–1485

  8. [15]

    Convergence analysis of machine learning algorithms for the numerical solution of mean field control and games: II—the finite horizon case

    Carmona, R., and Lauri`ere, M. Convergence analysis of machine learning algorithms for the numerical solution of mean field control and games: II—the finite horizon case. The Annals of Applied Probability 32, 6 (2022), 4065–4105

  9. [16]

    Friedrichs learning: weak solutions of partial differential equations via deep learning

    Chen, F., Huang, J., Wang, C., and Yang, H. Friedrichs learning: weak solutions of partial differential equations via deep learning. SIAM J. Sci. Comput. 45, 3 (2023), A1271–A1299

  10. [17]

    On the representation of solutions to elliptic PDEs in Barron spaces

    Chen, Z., Lu, J., and Lu, Y. On the representation of solutions to elliptic PDEs in Barron spaces. Advances in neural information processing systems 34 (2021), 6454–6465

  11. [18]

    Efficient Sobolev approximation of linear parabolic PDEs in high dimensions

    Cheridito, P., and Rossmannek, F. Efficient Sobolev approximation of linear parabolic PDEs in high dimensions. arXiv:2306.16811 (2023), 28 pages

  12. [19]

    A., Hutzenthaler, M., and Werner, P

    Cioica-Licht, P. A., Hutzenthaler, M., and Werner, P. T. Deep neural networks overcome the curse of dimensionality in the numerical approximation of semilinear partial differential equations. arXiv preprint arXiv:2205.14398 (2022)

  13. [20]

    Scientific machine learning through physics-informed neural networks: where we are and what’s next

    Cuomo, S., Schiano Di Cola, V., Giampaolo, F., Rozza, G., Raissi, M., and Piccialli, F. Scientific machine learning through physics-informed neural networks: where we are and what’s next. J. Sci. Comput. 92 , 3 (2022), Paper No. 88, 62

  14. [21]

    G., and Phan-Thien, N

    Dissanayake, M. G., and Phan-Thien, N. Neural-network-based ap- proximations for solving partial differential equations. communications in Numerical Methods in Engineering 10 , 3 (1994), 195–201

  15. [22]

    Domingo i Enrich, C., Han, J., Amos, B., Bruna, J., and Chen, R. T. Stochastic optimal control matching. Advances in Neural Information 10 Jiequn Han, Arnulf Jentzen, & Weinan E Processing Systems 37 (2024), 112459–112504

  16. [23]

    Z., et al.Convergence rate analysis for deep Ritz method

    Duan, C., Jiao, Y., Lai, Y., Li, D., Yang, J. Z., et al.Convergence rate analysis for deep Ritz method. Communications in Computational Physics 31, 4 (2022), 1020–1048

  17. [24]

    Deep learning-based numerical meth- ods for high-dimensional parabolic partial differential equations and backward stochastic differential equations

    E, W., Han, J., and Jentzen, A. Deep learning-based numerical meth- ods for high-dimensional parabolic partial differential equations and backward stochastic differential equations. Communications in Mathematics and Statis- tics 5, 4 (2017), 349–380

  18. [25]

    Algorithms for solving high dimensional PDEs: from nonlinear Monte Carlo to machine learning

    E, W., Han, J., and Jentzen, A. Algorithms for solving high dimensional PDEs: from nonlinear Monte Carlo to machine learning. Nonlinearity 35, 1 (2021), 278

  19. [26]

    The deep Ritz method: a deep learning-based numerical algorithm for solving variational problems

    E, W., and Yu, B. The deep Ritz method: a deep learning-based numerical algorithm for solving variational problems. Communications in Mathematics and Statistics 6 , 1 (2018), 1–12

  20. [27]

    DNN ex- pression rate analysis of high-dimensional PDEs: Application to option pric- ing

    Elbr¨achter, D., Grohs, P., Jentzen, A., and Schwab, C. DNN ex- pression rate analysis of high-dimensional PDEs: Application to option pric- ing. Constr. Approx. (2021), 1–69

  21. [28]

    Asymptotic expansion as prior knowledge in deep learning method for high dimensional BSDEs

    Fujii, M., Takahashi, A., and Takahashi, M. Asymptotic expansion as prior knowledge in deep learning method for high dimensional BSDEs. Asia-Pacific Financial Markets 26 , 3 (2019), 391–408

  22. [29]

    Approximation results for gradient descent trained shallow neural networks in 1d

    Gentile, R., and Welper, G. Approximation results for gradient descent trained shallow neural networks in 1d. arXiv:2209.08399 (2022), 49 pages

  23. [30]

    Neural networks-based algo- rithms for stochastic control and PDEs in finance

    Germain, M., Pham, H., and Warin, X. Neural networks-based algo- rithms for stochastic control and PDEs in finance. In Machine Learning and Data Sciences for Financial Markets . Cambridge University Press, (2023), 426–452

  24. [31]

    Deep xVA solver: A neural network–based counterparty credit risk management framework.SIAM Journal on Financial Mathematics 14 , 1 (2023), 314–352

    Gnoatto, A., Picarelli, A., and Reisinger, C. Deep xVA solver: A neural network–based counterparty credit risk management framework.SIAM Journal on Financial Mathematics 14 , 1 (2023), 314–352

  25. [32]

    Random feature neural networks learn Black-Scholes type PDEs without curse of dimensionality

    Gonon, L. Random feature neural networks learn Black-Scholes type PDEs without curse of dimensionality. J. Mach. Learn. Res. 24 (2023), Paper No. [189], 51

  26. [33]

    Deep neural network approximation for high-dimensional elliptic PDEs with boundary conditions

    Grohs, P., and Herrmann, L. Deep neural network approximation for high-dimensional elliptic PDEs with boundary conditions. IMA J. Numer. Anal. 42, 3 (2022), 2055–2082

  27. [34]

    A proof that artificial neural networks overcome the curse of dimensionality in the numerical approximation of Black–Scholes partial differential equations , vol

    Grohs, P., Hornung, F., Jentzen, A., and Von Wurstemberger, P. A proof that artificial neural networks overcome the curse of dimensionality in the numerical approximation of Black–Scholes partial differential equations , vol. 284. American Mathematical Society, 2023

  28. [36]

    Deep fictitious play for finding Markovian Nash equi- librium in multi-agent games

    Han, J., and Hu, R. Deep fictitious play for finding Markovian Nash equi- librium in multi-agent games. In Proceedings of The First Mathematical and Scientific Machine Learning Conference (MSML) (2020), vol. 107, pp. 221– 245

  29. [37]

    Convergence of deep fictitious play for Deep BSDE method 11 stochastic differential games

    Han, J., Hu, R., and Long, J. Convergence of deep fictitious play for Deep BSDE method 11 stochastic differential games. Frontiers of Mathematical Finance 1 , 2 (2022), 287–319

  30. [38]

    Learning high-dimensional McKean–Vlasov forward-backward stochastic differential equations with general distribution dependence

    Han, J., Hu, R., and Long, J. Learning high-dimensional McKean–Vlasov forward-backward stochastic differential equations with general distribution dependence. SIAM Journal on Numerical Analysis 62 , 1 (2024), 1–24

  31. [39]

    Deep Picard iteration for high-dimensional nonlinear PDEs

    Han, J., Hu, W., Long, J., and Zhao, Y. Deep Picard iteration for high-dimensional nonlinear PDEs

  32. [40]

    Solving high-dimensional partial differ- ential equations using deep learning

    Han, J., Jentzen, A., and E, W. Solving high-dimensional partial differ- ential equations using deep learning. Proceedings of the National Academy of Sciences 115, 34 (2018), 8505–8510

  33. [41]

    Convergence of the deep BSDE method for coupled FBSDEs

    Han, J., and Long, J. Convergence of the deep BSDE method for coupled FBSDEs. Probability, Uncertainty and Quantitative Risk 5 , 1 (2020), 1–33

  34. [42]

    Solving high-dimensional eigenvalue prob- lems using deep neural networks: A diffusion Monte Carlo like approach

    Han, J., Lu, J., and Zhou, M. Solving high-dimensional eigenvalue prob- lems using deep neural networks: A diffusion Monte Carlo like approach. Journal of Computational Physics (2020)

  35. [43]

    Uniformly accurate machine learning- based hydrodynamic models for kinetic equations

    Han, J., Ma, C., Ma, Z., and E, W. Uniformly accurate machine learning- based hydrodynamic models for kinetic equations. Proceedings of the National Academy of Sciences 116 , 44 (2019), 21983–21991

  36. [44]

    Han, J., Nica, M., and Stinchcombe, A. R. A derivative-free method for solving elliptic partial differential equations with deep neural networks. Journal of Computational Physics 419 (2020), 109672

  37. [45]

    Solving many-electron Schr¨ odinger equa- tion using deep neural networks

    Han, J., Zhang, L., and E, W. Solving many-electron Schr¨ odinger equa- tion using deep neural networks. Journal of Computational Physics 399 (2019), 108929

  38. [46]

    Deep residual learning for image recognition

    He, K., Zhang, X., Ren, S., and Sun, J. Deep residual learning for image recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition (2016), pp. 770–778

  39. [47]

    Deep neural network solution of the electronic Schr¨ odinger equation.arXiv preprint arXiv:1909.08423 (2019)

    Hermann, J., Sch¨atzle, Z., and No´e, F. Deep neural network solution of the electronic Schr¨ odinger equation.arXiv preprint arXiv:1909.08423 (2019)

  40. [48]

    E., and Kawaguchi, K

    Hu, Z., Shi, Z., Karniadakis, G. E., and Kawaguchi, K. Hutchinson trace estimation for high-dimensional and high-order physics-informed neu- ral networks. Computer Methods in Applied Mechanics and Engineering 424 (2024), 116883

  41. [49]

    J., and Roberts, L

    Huang, J., Cheng, Y., Christlieb, A. J., and Roberts, L. F. Machine learning moment closure models for the radiative transfer equation i: directly learning a gradient based closure. Journal of Computational Physics 453 (2022), 110941

  42. [50]

    Deep backward schemes for high- dimensional nonlinear PDEs

    Hur´e, C., Pham, H., and Warin, X. Deep backward schemes for high- dimensional nonlinear PDEs. Mathematics of Computation 89 , 324 (2020), 1547–1579

  43. [51]

    Hutzenthaler, M., Jentzen, A., and Kruse, T.Overcoming the curse of dimensionality in the numerical approximation of parabolic partial differential equations with gradient-dependent nonlinearities. Found. Comput. Math. 22 , 4 (2022), 905–966

  44. [52]

    Hutzenthaler, M., Jentzen, A., Kruse, T., and Nguyen, T. A. A proof that rectified deep neural networks overcome the curse of dimensionality 12 Jiequn Han, Arnulf Jentzen, & Weinan E in the numerical approximation of semilinear heat equations. SN Partial Differential Equations...

  45. [53]

    Ibragimov, S., Jentzen, A., and Riekert, A. Convergence to good non- optimal critical points in the training of neural networks: Gradient descent optimization with one random initialization overcomes all bad non-global local minima with high probability. arXiv:2212.13111 (2022...

  46. [54]

    Jentzen, A., Salimova, D., and Welti, T. A proof that deep artifi- cial neural networks overcome the curse of dimensionality in the numerical approximation of Kolmogorov partial differential equations with constant dif- fusion and nonlinear drift coefficients. Commun. Math. Sc...

  47. [55]

    Three algorithms for solving high-dimensional fully-coupled FBSDEs through deep learning

    Ji, S., Peng, S., Peng, Y., and Zhang, X. Three algorithms for solving high-dimensional fully-coupled FBSDEs through deep learning. IEEE Intel- ligent Systems (2020)

  48. [56]

    Numerical solu- tion of elliptic partial differential equation using radial basis function neural networks

    Jianyu, L., Siwei, L., Yingjian, Q., and Yaping, H. Numerical solu- tion of elliptic partial differential equation using radial basis function neural networks. Neural Networks 16 , 5-6 (2003), 729–734

  49. [57]

    On distributions of certain Wiener functionals

    Kac, M. On distributions of certain Wiener functionals. Transactions of the American Mathematical Society 65, 1 (1949), 1–13

  50. [58]

    E., Kevrekidis, I

    Karniadakis, G. E., Kevrekidis, I. G., Lu, L., Perdikaris, P., Wang, S., and Yang, L. Physics-informed machine learning. Nat. Rev. Phys. 3 (2021), 422–440

  51. [59]

    T., and W ¨urschmidt, M

    Knochenhauer, C., Hager, O., Reimers, C., Schnell, L., Seifried, F. T., and W ¨urschmidt, M. Convergence rates for a deep learning algo- rithm for semilinear PDEs. Available at SSRN (2022)

  52. [60]

    E., Likas, A., and Fotiadis, D

    Lagaris, I. E., Likas, A., and Fotiadis, D. I. Artificial neural networks for solving ordinary and partial differential equations. IEEE Transactions on Neural Networks 9 , 5 (1998), 987–1000

  53. [61]

    Learning mean field games: A survey

    Lauri`ere, M., Perrin, S., Geist, M., and Pietquin, O. Learning mean field games: A survey. arXiv preprint arXiv:2205.12944 (2022)

  54. [62]

    Learning invariance preserving moment closure model for Boltzmann–BGK equation

    Li, Z., Dong, B., and Wang, Y. Learning invariance preserving moment closure model for Boltzmann–BGK equation. Communications in Mathemat- ics and Statistics 11 , 1 (2023), 59–101

  55. [63]

    Deep learning-based least squares forward- backward stochastic differential equation solver for high-dimensional deriva- tive pricing

    Liang, J., Xu, Z., and Li, P. Deep learning-based least squares forward- backward stochastic differential equation solver for high-dimensional deriva- tive pricing. Quantitative Finance 21 , 8 (2021), 1309–1323

  56. [64]

    A priori generalization analysis of the deep Ritz method for solving high dimensional elliptic partial differential equations

    Lu, Y., Lu, J., and Wang, M. A priori generalization analysis of the deep Ritz method for solving high dimensional elliptic partial differential equations. In Conference on learning theory (2021), PMLR, pp. 3196–3241

  57. [65]

    Luo, D., and Clark, B. K. Backflow transformations via neural networks for quantum many-body wave functions. Physical Review Letters 122 , 22 (2019), 226401

  58. [66]

    Adaptive deep learning for high-dimensional Hamilton–Jacobi–Bellman equations

    Nakamura-Zimmerer, T., Gong, Q., and Kang, W. Adaptive deep learning for high-dimensional Hamilton–Jacobi–Bellman equations. SIAM Journal on Scientific Computing 43 , 2 (2021), A1221–A1247

  59. [67]

    Neufeld, A., and Nguyen, T. A. Rectified deep neural networks over- Deep BSDE method 13 come the curse of dimensionality in the numerical approximation of gradient- dependent semilinear heat equations. arXiv:2403.09200 (2024), 22 pages

  60. [68]

    A., and Wu, S

    Neufeld, A., Nguyen, T. A., and Wu, S. Deep ReLU neural networks overcome the curse of dimensionality when approximating semilinear partial integro-differential equations. arXiv:2310.15581 (2023), 38 pages

  61. [69]

    Solving high-dimensional Hamilton–Jacobi– Bellman PDEs using neural networks: perspectives from the theory of con- trolled diffusions and measures on path space

    N¨usken, N., and Richter, L. Solving high-dimensional Hamilton–Jacobi– Bellman PDEs using neural networks: perspectives from the theory of con- trolled diffusions and measures on path space. Partial differential equations and applications 2 , 4 (2021), 48

  62. [70]

    Interpolating between BSDEs and PINNs: deep learning for elliptic and parabolic boundary value problems

    N¨usken, N., and Richter, L. Interpolating between BSDEs and PINNs: deep learning for elliptic and parabolic boundary value problems. Journal of Machine Learning 2, 1 (2023), 31–64

  63. [71]

    Stochastic Differential Equations: An Introduction with Ap- plications

    Oksendal, B. Stochastic Differential Equations: An Introduction with Ap- plications. Springer Science & Business Media, 2013

  64. [72]

    Backward stochastic differential equations and quasilinear parabolic partial differential equations

    Pardoux, ´E., and Peng, S. Backward stochastic differential equations and quasilinear parabolic partial differential equations. In Stochastic partial differential equations and their applications (Charlotte, NC, 1991) , vol. 176 of Lecture Notes in Control and Inform. Sci. Spr...

  65. [73]

    Forward-backward stochastic differential equa- tions and quasilinear parabolic PDEs

    Pardoux, ´E., and Tang, S. Forward-backward stochastic differential equa- tions and quasilinear parabolic PDEs. Probab. Theory Related Fields 114 , 2 (1999), 123–150

  66. [74]

    Available at SSRN (2024)

    Payne, J., Rebei, A., and Yang, Y.Deep learning for search and matching models. Available at SSRN (2024)

  67. [75]

    S., Matthews, A

    Pfau, D., Spencer, J. S., Matthews, A. G. d. G., and Foulkes, W. Ab-initio solution of the many-electron Schr¨ odinger equation with deep neural networks. arXiv preprint arXiv:1909.02487 (2019)

  68. [76]

    Neural networks-based back- ward scheme for fully nonlinear PDEs

    Pham, H., Warin, X., and Germain, M. Neural networks-based back- ward scheme for fully nonlinear PDEs. SN Partial Differential Equations and Applications 2, 1 (2021), 16

  69. [77]

    Raissi, M., Perdikaris, P., and Karniadakis, G. E. Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations. Journal of Com- putational Physics 378 (2019), 686–707

  70. [78]

    DGM: A deep learning algorithm for solving partial differential equations

    Sirignano, J., and Spiliopoulos, K. DGM: A deep learning algorithm for solving partial differential equations. Journal of Computational Physics 375 (2018), 1339–1364

  71. [79]

    P., Kumar, A., Ermon, S., and Poole, B

    Song, Y., Sohl-Dickstein, J., Kingma, D. P., Kumar, A., Ermon, S., and Poole, B. Score-based generative modeling through stochastic dif- ferential equations. In International Conference on Learning Representations (2021)

  72. [80]

    Towards fast weak adversarial training to solve high dimensional parabolic partial differential equations using XNODE-WAN

    Valsecchi Oliva, P., Wu, Y., He, C., and Ni, H. Towards fast weak adversarial training to solve high dimensional parabolic partial differential equations using XNODE-WAN. J. Comput. Phys. 463 (2022), Paper No. 111233, 17

  73. [81]

    Approximation results for gradient descent trained neural net- works

    Welper, G. Approximation results for gradient descent trained neural net- works. arXiv:2309.04860 (2023), 69 pages. 14 Jiequn Han, Arnulf Jentzen, & Weinan E

  74. [82]

    Weak adversarial networks for high-dimensional partial differential equations

    Zang, Y., Bao, G., Ye, X., and Zhou, H. Weak adversarial networks for high-dimensional partial differential equations. Journal of Computational Physics (2020), 109409

  75. [83]

    Initial value problem enhanced sampling for closed-loop optimal control design with deep neural networks

    Zhang, X., Long, J., Hu, W., E, W., and Han, J. Initial value problem enhanced sampling for closed-loop optimal control design with deep neural networks. arXiv preprint arXiv:2209.04078 (2022)

  76. [84]

    Actor-critic method for high dimensional static Hamilton–Jacobi–Bellman partial differential equations based on neural networks

    Zhou, M., Han, J., and Lu, J. Actor-critic method for high dimensional static Hamilton–Jacobi–Bellman partial differential equations based on neural networks. SIAM Journal on Scientific Computing 43, 6 (2021), A4043–A4066. (JH) Center for Computational Mathematics, Flatiron In...

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.