用高斯混合模型动态引导训练,让物理神经网络更准地解复杂微分方程。
From Simple to Complex: Curriculum-Guided Physics-Informed Neural Networks via Gaussian Mixture Models

- 根据残差分布自动识别难易区域,分阶段训练。
- 在六类典型方程上误差降低最高达97.8%。
- 适合求解强非线性、多尺度的复杂物理问题。
物理信息神经网络(PINNs)提供了一种无网格求解偏微分方程(PDEs)的框架,但训练常受梯度病态、谱偏差和收敛困难影响,尤其在强非线性、陡峭梯度或多尺度问题中表现不佳。我们提出课程引导高斯混合物理信息神经网络(CGMPINN),将高斯混合模型与动态课程学习结合。具体而言,周期性地对PDE残差分布拟合高斯混合模型,量化空间上学习难度差异;通过平滑的课程调度,逐步将训练重点从简单区域转向困难区域;早期优化中,基于精度的方差调节抑制不可靠聚类。该双重课程机制共享一个课程参数,可与自适应损失平衡结合。我们进一步建立理论保证:诱导时变损失的梯度范数具有次线性收敛性,课程加权损失与标准PDE损失存在统一等价性,且泛化界显式刻画了加权引入的偏差。在六类基准PDE(涵盖椭圆、抛物、双曲、对流主导及非线性反应-扩散型)上的实验表明,CGMPINN始终优于对比方法,相对$L_2$误差最低,相比标准PINN在相近计算成本下最高降低97.8%。代码已开源:https://github.com/Mathematics-Yang/CGMPINN。
原文摘要 · Abstract (English)
Physics-informed neural networks (PINNs) offer a mesh-free framework for solving partial differential equations (PDEs), yet training often suffers from gradient pathologies, spectral bias, and poor convergence, especially for problems with strong nonlinearity, sharp gradients, or multiscale features. We propose the Curriculum-Guided Gaussian Mixture Physics-Informed Neural Network (CGMPINN), which integrates Gaussian mixture modeling with dynamic curriculum learning. Specifically, a GMM is periodically fitted to the PDE residual distribution to quantify spatially varying learning difficulty. A smooth curriculum schedule progressively shifts training focus from easy to harder regions, while precision-based variance modulation suppresses unreliable clusters during early optimization. This dual curriculum is governed by a shared curriculum parameter and can be combined with self-adaptive loss balancing. We further establish theoretical guarantees, including sublinear convergence of the gradient norm for the induced time-varying loss, uniform equivalence between the curriculum-weighted and standard PDE losses, and a generalization bound with an explicit weighting-induced bias characterization. Experiments on six benchmark PDEs spanning elliptic, parabolic, hyperbolic, advection-dominated, and nonlinear reaction-diffusion types show that CGMPINN consistently achieves the lowest relative $L_2$ and maximum absolute errors among all compared methods, reducing relative $L_2$ error by up to 97.8\% over the standard PINN at comparable cost. Our code is publicly available at https://github.com/Mathematics-Yang/CGMPINN.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。