arXiv:2507.06967cs.LGcs.AI2025-07被引 2

噪声数据下训练PINN需更大模型,否则无法降低误差。

Noisy PDE Training Requires Bigger PINNs

  • 分析噪声数据中PINN的最小网络规模要求
  • 证明模型参数量需满足 $d_N\log d_N\gtrsim N_s η^2$ 才能低于噪声方差
  • 适用于高维PDE求解且数据含噪的场景

物理信息神经网络(PINNs)广泛用于求解偏微分方程(PDE),尤其在高维场景。现实中数据常含噪声,理解预测器能否达到低经验风险至关重要。本文研究哈密顿-雅可比-贝尔曼(HJB)PDE上的PINN,建立监督学习下经验风险低于噪声标签方差 $σ^2$ 所需的网络规模下界:若经验风险为 $O(η)$ 且低于 $σ^2$,则必有 $d_N\log d_N\gtrsim N_s η^2$,其中 $N_s$ 为样本数,$d_N$ 为可训练参数量。在边界标签含噪的无监督情形亦存在类似约束。因此,仅增加噪声标签数量无法实现“免费午餐”。我们在HJB、泊松及纳维-斯托克斯(以泰勒-格林解为基准)方程上进行实验,验证了模型必须超过某一阈值规模才能将误差降至 $σ^2$ 以下。该结果为噪声数据下PINN的参数设计提供了定量依据。

原文摘要 · Abstract (English)

Physics-Informed Neural Networks (PINNs) are increasingly used to approximate solutions of partial differential equations (PDEs), particularly in high dimensions. In real-world settings, data are often noisy, making it crucial to understand when a predictor can still achieve low empirical risk. Yet, little is known about the conditions under which a PINN can do so effectively. We analyse PINNs applied to the Hamilton--Jacobi--Bellman (HJB) PDE and establish a lower bound on the network size required for the supervised PINN empirical risk to fall below the variance of noisy supervision labels. Specifically, if a predictor achieves empirical risk $O(η)$ below $σ^2$ (the variance of the supervision data), then necessarily $d_N\log d_N\gtrsim N_s η^2$, where $N_s$ is the number of samples and $d_N$ the number of trainable parameters. A similar constraint holds in the fully unsupervised PINN setting when boundary labels are noisy. Thus, simply increasing the number of noisy supervision labels does not offer a ``free lunch'' in reducing empirical risk. We also give empirical studies on the HJB PDE, the Poisson PDE and the the Navier-Stokes PDE set to produce the Taylor-Green solutions. In these experiments we demonstrate that PINNs indeed need to be beyond a threshold model size for them to train to errors below $σ^2$. These results provide a quantitative foundation for understanding parameter requirements when training PINNs in the presence of noisy data.

PINNPDE求解噪声鲁棒性模型规模

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。