 Deep neural network approximations for solutions of PDEs based on Monte Carlo algorithmsPhilipp Grohs (),
Arnulf Jentzen () and
Diyora Salimova ()
Partial Differential Equations and Applications, 2022, vol. 3, issue 4, 1-41 Abstract: Abstract In the past few years deep artificial neural networks (DNNs) have been successfully employed in a large number of computational problems including, e.g., language processing, image recognition, fraud detection, and computational advertisement. Recently, it has also been proposed in the scientific literature to reformulate high-dimensional partial differential equations (PDEs) as stochastic learning problems and to employ DNNs together with stochastic gradient descent methods to approximate the solutions of such high-dimensional PDEs. There are also a few mathematical convergence results in the scientific literature which show that DNNs can approximate solutions of certain PDEs without the curse of dimensionality in the sense that the number of real parameters employed to describe the DNN grows at most polynomially both in the PDE dimension $$d \in {\mathbb {N}}$$ d ∈ N and the reciprocal of the prescribed approximation accuracy $$\varepsilon > 0$$ ε > 0 . One key argument in most of these results is, first, to employ a Monte Carlo approximation scheme which can approximate the solution of the PDE under consideration at a fixed space-time point without the curse of dimensionality and, thereafter, to prove then that DNNs are flexible enough to mimic the behaviour of the employed approximation scheme. Having this in mind, one could aim for a general abstract result which shows under suitable assumptions that if a certain function can be approximated by any kind of (Monte Carlo) approximation scheme without the curse of dimensionality, then the function can also be approximated with DNNs without the curse of dimensionality. It is a subject of this article to make a first step towards this direction. In particular, the main result of this paper, roughly speaking, shows that if a function can be approximated by means of some suitable discrete approximation scheme without the curse of dimensionality and if there exist DNNs which satisfy certain regularity properties and which approximate this discrete approximation scheme without the curse of dimensionality, then the function itself can also be approximated with DNNs without the curse of dimensionality. Moreover, for the number of real parameters used to describe such approximating DNNs we provide an explicit upper bound for the optimal exponent of the dimension $$d \in {\mathbb {N}}$$ d ∈ N of the function under consideration as well as an explicit lower bound for the optimal exponent of the prescribed approximation accuracy $$\varepsilon >0$$ ε > 0 . As an application of this result we derive that solutions of suitable Kolmogorov PDEs can be approximated with DNNs without the curse of dimensionality. Keywords: 65C99; 68T05 (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:pardea:v:3:y:2022:i:4:d:10.1007_s42985-021-00100-z Ordering information: This journal article can be ordered from DOI: 10.1007/s42985-021-00100-z Access Statistics for this article Partial Differential Equations and Applications is currently edited by Zhitao Zhang More articles in Partial Differential Equations and Applications from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.