A learning scheme by sparse grids and Picard approximations for semilinear parabolic PDEs

Author:

Chassagneux Jean-François1,Chen Junchao1,Frikha Noufel1,Zhou Chao2

Affiliation:

1. Laboratoire de Probabilités , Statistiques et Modélisation, Bâtiment Sophie Germain, 5ème étage place Aurélie Nemours 75013 Paris, France

2. Department of Mathematics and Risk Management Institute , National University of Singapore, 21 Heng Mui Keng Terrace I 3 Building #04-03 Singapore 119613

Abstract

Abstract Relying on the classical connection between backward stochastic differential equations and nonlinear parabolic partial differential equations (PDEs), we propose a new probabilistic learning scheme for solving high-dimensional semilinear parabolic PDEs. This scheme is inspired by the approach coming from machine learning and developed using deep neural networks in Han et al. (2018, Solving high-dimensional partial differential equations using deep learning. Proc. Natl. Acad. Sci., 115, 8505–8510. Our algorithm is based on a Picard iteration scheme in which a sequence of linear-quadratic optimization problem is solved by means of stochastic gradient descent algorithm. In the framework of a linear specification of the approximation space, we manage to prove a convergence result for our scheme, under some smallness condition. In practice, in order to be able to treat high-dimensional examples, we employ sparse-grid approximation spaces. In the case of periodic coefficients and using pre-wavelet basis functions, we obtain an upper bound on the global complexity of our method. It shows, in particular, that the curse of dimensionality is tamed in the sense that in order to achieve a root mean squared error of order $\varepsilon $, for a prescribed precision $\varepsilon $, the complexity of the Picard algorithm grows polynomially in $\varepsilon ^{-1}$ up to some logarithmic factor $|\!\log (\varepsilon )|$, whose exponent grows linearly with respect to the PDE dimension. Various numerical results are presented to validate the performance of our method, and to compare them with some recent machine learning schemes proposed in E et al. (2017, Deep learning-based numerical methods for high-dimensional parabolic partial differential equations and backward stochastic differential equations. Commun. Math. Stat., 5, 349–380) and Huré et al. (2020, Deep backward schemes for high-dimensional nonlinear PDEs. Math. Comput., 89, 1547–1579).

Publisher

Oxford University Press (OUP)

Subject

Applied Mathematics,Computational Mathematics,General Mathematics

Reference50 articles.

1. Error analysis of the optimal quantization algorithm for obstacle problems;Bally;Stoch. Process. Their Appl.,2003

2. A quantization algorithm for solving multidimensional discrete-time optimal stopping problems;Bally;Bernoulli,2003

3. Machine learning approximation algorithms for high-dimensional fully nonlinear partial differential equations and second-order backward stochastic differential equations;Beck;J. Nonlinear Sci.,2017

4. An overview on deep learning-based approximation methods for partial differential equations;Beck,2020

5. A forward scheme for backward sdes;Bender;Stoch. Process. Their Appl.,2007

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3