REVIEW 4 cited by
An overview on deep learning-based approximation methods for partial differential equations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
It is one of the most challenging problems in applied mathematics to approximatively solve high-dimensional partial differential equations (PDEs). Recently, several deep learning-based approximation algorithms for attacking this problem have been proposed and tested numerically on a number of examples of high-dimensional PDEs. This has given rise to a lively field of research in which deep learning-based methods and related Monte Carlo methods are applied to the approximation of high-dimensional PDEs. In this article we offer an introduction to this field of research by revisiting selected mathematical results related to deep learning approximation methods for PDEs and reviewing the main ideas of their proofs. We also provide a short overview of the recent literature in this area of research.
Forward citations
Cited by 4 Pith papers
-
Full history recursive multilevel Picard approximations suffer from the curse of dimensionality for the Hamilton-Jacobi-Bellman equation of a stochastic control problem
For a simple HJB control example, MLP approximations have L2 error growing like d^{n/2}/(c^n sqrt(n!)) - 1, so no polynomial-in-dimension error bound can hold uniformly as the number of levels grows.
-
A Computational Method for Solving the Stochastic Joint Replenishment Problem in High Dimensions
A deep BSDE-inspired simulation method solves the stochastic joint replenishment problem up to 50 SKUs, matching or beating benchmark heuristic policies.
-
Regulation or Competition:Major-Minor Optimal Liquidation across Dark and Lit Pools
A dynamic make-take fee and compensation scheme is constructed for optimal liquidation across lit and dark pools and is claimed to reduce market impact relative to a competitive major-minor market.
-
Energy Manifold Natural Gradient Descent: Riemannian Optimization for Neural PDE Solvers
Energy Manifold Natural Gradient Descent (EMNGD) defines the energy natural gradient on a Riemannian parameter manifold and proves it equals the energy-metric projection of the function-space Newton step.
Discussion (0). Continue with ORCID to comment.