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

高维非线性偏微分方程的深度皮卡迭代法

Deep Picard Iteration for High-Dimensional Nonlinear PDEs

Jiequn Han, Wei Hu, Jihao Long, Yue Zhao

AI总结:

本文提出深度皮卡迭代法,将高维PDE神经网络求解转化为基于函数值与梯度的简单回归任务,并通过控制变量解决梯度估计方差问题,在100维问题上优于现有方法。

摘要:

我们提出深度皮卡迭代(DPI)方法,这是一种用于求解高维偏微分方程(PDEs)的新型深度学习方法。DPI的核心创新在于利用皮卡迭代,将基于神经网络的PDE求解中通常复杂的训练目标重新表述为基于函数值和梯度的更简单、标准的回归任务。这种设计不仅大大简化了优化过程,还通过并行数据生成提供了进一步可扩展性的潜力。关键在于,为了在DPI方法中充分实现同时回归函数值和梯度的优势,我们通过引入控制变量解决了梯度估计量中无穷方差的问题,并给出了相应的理论分析支持。我们在高达100维的问题上的实验表明,DPI始终优于现有的最先进方法,对超参数具有更强的鲁棒性,尤其是在长时间跨度和强非线性等具有挑战性的场景中。代码可在https://github.com/DeepOptimalControl/DeepPicardIteration获取。

英文摘要:

We present the Deep Picard Iteration (DPI) method, a new deep learning approach for solving high-dimensional partial differential equations (PDEs). The core innovation of DPI lies in its use of Picard iteration to reformulate the typically complex training objectives of neural network-based PDE solutions into much simpler, standard regression tasks based on function values and gradients. This design not only greatly simplifies the optimization process but also offers the potential for further scalability through parallel data generation. Crucially, to fully realize the benefits of regressing on both function values and gradients in the DPI method, we address the issue of infinite variancein the estimators of gradients by incorporating a control variate, supported by our theoretical analysis. Our experiments on problems up to 100 dimensions demonstrate that DPI consistently outperforms existing state-of-the-art methods, with greater robustness to hyperparameters, particularly in challenging scenarios with long time horizons and strong nonlinearity. The code is available at https://github.com/DeepOptimalControl/DeepPicardIteration.

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

↑