Abstract
Developing algorithms for solving high-dimensional partial differential equations (PDEs) has been an exceedingly difficult task for a long time, due to the notoriously difficult problem known as the “curse of dimensionality.” This paper introduces a deep learning-based approach that can handle general high-dimensional parabolic PDEs. To this end, the PDEs are reformulated using backward stochastic differential equations and the gradient of the unknown solution is approximated by neural networks, very much in the spirit of deep reinforcement learning with the gradient acting as the policy function. Numerical results on examples including the nonlinear Black–Scholes equation, the Hamilton–Jacobi–Bellman equation, and the Allen–Cahn equation suggest that the proposed algorithm is quite effective in high dimensions, in terms of both accuracy and cost. This opens up possibilities in economics, finance, operational research, and physics, by considering all participating agents, assets, resources, or particles together at the same time, instead of making ad hoc assumptions on their interrelationships.
Publisher
Proceedings of the National Academy of Sciences
Reference33 articles.
1. Bellman RE (1957) Dynamic Programming (Princeton Univ Press, Princeton).
2. Goodfellow I Bengio Y Courville A (2016) Deep Learning (MIT Press, Cambridge, MA).
3. Deep learning
4. Imagenet classification with deep convolutional neural networks;Krizhevsky,2012
5. Deep Neural Networks for Acoustic Modeling in Speech Recognition: The Shared Views of Four Research Groups
Cited by
950 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献