用动态模分解提升图神经网络对复杂动态的捕捉能力。
When Graph Neural Networks Meet Dynamic Mode Decomposition
- 将图神经网络动态与动态模分解结合,学习低秩线性算子
- 在多类图数据上实现领先性能,尤其擅长长程依赖建模
- 适合研究图动力学、物理系统建模的学者使用
图神经网络(GNN)已成为处理图结构数据预测任务的核心工具。近期研究发现GNN特征传播与扩散过程类似,可视为动力系统。本文进一步将GNN动态与现代科普曼理论及其数值方法——动态模分解(DMD)相联系。我们展示如何利用DMD基于系统多个状态估计一个低秩、有限维线性算子,有效近似图中节点间的非线性相互作用。该方法能准确高效地捕捉图内复杂动态。理论上建立了DMD估计算子与原始动态算子之间的联系。基于此,我们提出一类新型DMD-GNN模型,充分利用DMD提供的低秩特征函数。此外,我们探讨在DMD计算中引入对称性等领域约束的可能性,使对应GNN模型尊重底层系统的已知物理特性。实验验证表明,所提模型在有向图、大规模图、长程交互及时空图等多种任务中表现优异,且在链接预测任务中作为编码器效果突出。结果表明,集成DMD的GNN达到当前最优性能,凸显了将动力系统分析工具融入GNN框架的潜力。
原文摘要 · Abstract (English)
Graph Neural Networks (GNNs) have emerged as fundamental tools for a wide range of prediction tasks on graph-structured data. Recent studies have drawn analogies between GNN feature propagation and diffusion processes, which can be interpreted as dynamical systems. In this paper, we delve deeper into this perspective by connecting the dynamics in GNNs to modern Koopman theory and its numerical method, Dynamic Mode Decomposition (DMD). We illustrate how DMD can estimate a low-rank, finite-dimensional linear operator based on multiple states of the system, effectively approximating potential nonlinear interactions between nodes in the graph. This approach allows us to capture complex dynamics within the graph accurately and efficiently. We theoretically establish a connection between the DMD-estimated operator and the original dynamic operator between system states. Building upon this foundation, we introduce a family of DMD-GNN models that effectively leverage the low-rank eigenfunctions provided by the DMD algorithm. We further discuss the potential of enhancing our approach by incorporating domain-specific constraints such as symmetry into the DMD computation, allowing the corresponding GNN models to respect known physical properties of the underlying system. Our work paves the path for applying advanced dynamical system analysis tools via GNNs. We validate our approach through extensive experiments on various learning tasks, including directed graphs, large-scale graphs, long-range interactions, and spatial-temporal graphs. We also empirically verify that our proposed models can serve as powerful encoders for link prediction tasks. The results demonstrate that our DMD-enhanced GNNs achieve state-of-the-art performance, highlighting the effectiveness of integrating DMD into GNN frameworks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。