arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.09535cs.LGcs.NAmath.NAstat.ML
收藏

参数偏微分方程的多极图神经算子

Multipole Graph Neural Operator for Parametric Partial Differential Equations

Caltech(加州理工学院);Purdue University(普渡大学)

Zongyi Li, Nikola Kovachki, Kamyar Azizzadenesheli, Burigede Liu, Kaushik Bhattacharya, Andrew Stuart, Anima Anandkumar

摘要:

使用基于深度学习的方法来模拟物理系统和求解偏微分方程(PDE)的主要挑战之一是以神经网络的期望结构来公式化基于物理的数据。图神经网络(GNN)在这一领域已经流行起来,因为图提供了一种自然的方式来建模粒子相互作用,并提供了一种清晰的方式来离散连续模型。然而,为近似这些任务而构造的图通常忽略长距离相互作用,这是由于计算复杂性相对于节点数量的不利缩放。由于这些近似的误差与系统的离散化成比例,从而不允许在网格细化下进行泛化。受经典多极子方法的启发,我们提出了一种新的多层图神经网络框架,该框架仅以线性复杂度捕获所有范围内的相互作用。我们的多级公式相当于递归地向核矩阵添加诱导点,将GNN与核的多分辨率矩阵分解统一起来。实验证实,我们的多图网络学习离散化不变的解决方案运营商的偏微分方程,可以在线性时间进行评估。

英文摘要:

One of the main challenges in using deep learning-based methods for simulating physical systems and solving partial differential equations (PDEs) is formulating physics-based data in the desired structure for neural networks. Graph neural networks (GNNs) have gained popularity in this area since graphs offer a natural way of modeling particle interactions and provide a clear way of discretizing the continuum models. However, the graphs constructed for approximating such tasks usually ignore long-range interactions due to unfavorable scaling of the computational complexity with respect to the number of nodes. The errors due to these approximations scale with the discretization of the system, thereby not allowing for generalization under mesh-refinement. Inspired by the classical multipole methods, we propose a novel multi-level graph neural network framework that captures interaction at all ranges with only linear complexity. Our multi-level formulation is equivalent to recursively adding inducing points to the kernel matrix, unifying GNNs with multi-resolution matrix factorization of the kernel. Experiments confirm our multi-graph network learns discretization-invariant solution operators to PDEs and can be evaluated in linear time.

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

↑