arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2006.02199math.PRcs.LGcs.NAmath.APmath.NA
收藏

高维偏微分方程的时空深度神经网络逼近

Space-time deep neural network approximations for high-dimensional partial differential equations

Faculty of Mathematics, Karlsruhe Institute of Technology(卡尔斯鲁厄理工学院数学学院);Seminar for Applied Mathematics, Department of Mathematics, ETH Zurich(苏黎世联邦理工学院数学系应用数学研讨班);Department for Applied Mathematics, University of Freiburg(弗莱堡大学应用数学系)

Fabian Hornung, Arnulf Jentzen, Diyora Salimova

AI总结:

本文研究高维偏微分方程的求解,提出在时空区域上利用深度神经网络逼近Kolmogorov PDE的解,证明了该方法在PDE维度和精度倒数上至多呈多项式增长,从而克服了维度灾难。

摘要:

近似求解高维偏微分方程(PDEs)是应用数学中最具挑战性的问题之一,且科学文献中大多数用于PDE的数值逼近方法都受到所谓维度灾难的影响,即在相应逼近方案中为获得逼近精度$\varepsilon>0$所用的计算操作数随PDE维度和/或$\varepsilon$的倒数呈指数增长。近期,一些基于深度学习的PDE逼近方法被提出,针对此类方法的各种数值模拟表明,深度神经网络(DNN)逼近可能确实具有克服维度灾难的能力,即用于描述逼近DNN的实参数个数在PDE维度$d\in\mathbb{N}$和规定精度$\varepsilon>0$的倒数上至多呈多项式增长。如今科学文献中也有一些严格结果通过证明DNN在逼近PDE解时克服了维度灾难来证实这一猜想。这些结果均表明,DNN在固定时间点$T>0$和空间中的紧致立方体$[a,b]^d$上逼近合适的PDE解时克服了维度灾难,但没有一个结果回答了$[0,T]\times [a,b]^d$上的整个PDE解是否能由DNN无维度灾难地逼近这一问题。本文正是为了解决此问题。更具体地说,本工作的主要结果特别证明了对于每个$a\in\mathbb{R}$、$b\in (a,\infty)$,某些Kolmogorov PDE的解可以在时空区域$[0,T]\times [a,b]^d$上由DNN无维度灾难地逼近。

英文摘要:

It is one of the most challenging issues in applied mathematics to approximately solve high-dimensional partial differential equations (PDEs) and most of the numerical approximation methods for PDEs in the scientific literature suffer from the so-called curse of dimensionality in the sense that the number of computational operations employed in the corresponding approximation scheme to obtain an approximation precision $\varepsilon>0$ grows exponentially in the PDE dimension and/or the reciprocal of $\varepsilon$. Recently, certain deep learning based approximation methods for PDEs have been proposed and various numerical simulations for such methods suggest that deep neural network (DNN) approximations might have the capacity to indeed overcome the curse of dimensionality in the sense that the number of real parameters used to describe the approximating DNNs grows at most polynomially in both the PDE dimension $d\in\mathbb{N}$ and the reciprocal of the prescribed accuracy $\varepsilon>0$. There are now also a few rigorous results in the scientific literature which substantiate this conjecture by proving that DNNs overcome the curse of dimensionality in approximating solutions of PDEs. Each of these results establishes that DNNs overcome the curse of dimensionality in approximating suitable PDE solutions at a fixed time point $T>0$ and on a compact cube $[a,b]^d$ in space but none of these results provides an answer to the question whether the entire PDE solution on $[0,T]\times [a,b]^d$ can be approximated by DNNs without the curse of dimensionality. It is precisely the subject of this article to overcome this issue. More specifically, the main result of this work in particular proves for every $a\in\mathbb{R}$, $ b\in (a,\infty)$ that solutions of certain Kolmogorov PDEs can be approximated by DNNs on the space-time region $[0,T]\times [a,b]^d$ without the curse of dimensionality.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑