arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.01780math.NAcs.NA
收藏

线性二阶椭圆型偏微分方程物理信息神经网络的一个收敛速率

A rate of convergence of Physics Informed Neural Networks for the linear second order elliptic PDEs

Yuling Jiao, Yanming Lai, Dingwei Li, Xiliang Lu, Fengru Wang, Yang Wang, Jerry Zhijian Yang

摘要:

近年来,物理信息神经网络(PINN)已被证明是一个强大的工具,解决偏微分方程的经验。然而,PINN的数值分析仍然缺失。在本文中,我们证明了PINNs的收敛速度为二阶椭圆型方程与Dirichlet边界条件,通过建立上界的训练样本的数量,深度和宽度的深度神经网络,以达到所需的精度。PINN的误差被分解为近似误差和统计误差,其中近似误差在具有$\mathrm{ReLU}^{3}$网络(具有激活函数$\max\{0,x^3\}$的深度网络)的$C^2$范数中给出,并且统计误差由Rademacher复杂度估计。我们得到了梯度范数的非Lipschitz合成与$\mathrm{ReLU}^{3}$网络的Rademacher复杂性的界,这是一个非常有意义的独立结果.

英文摘要:

In recent years, physical informed neural networks (PINNs) have been shown to be a powerful tool for solving PDEs empirically. However, numerical analysis of PINNs is still missing. In this paper, we prove the convergence rate to PINNs for the second order elliptic equations with Dirichlet boundary condition, by establishing the upper bounds on the number of training samples, depth and width of the deep neural networks to achieve desired accuracy. The error of PINNs is decomposed into approximation error and statistical error, where the approximation error is given in $C^2$ norm with $\mathrm{ReLU}^{3}$ networks (deep network with activations function $\max\{0,x^3\}$) and the statistical error is estimated by Rademacher complexity. We derive the bound on the Rademacher complexity of the non-Lipschitz composition of gradient norm with $\mathrm{ReLU}^{3}$ network, which is of immense independent interest.

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

↑