arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2306.04495cs.LGcs.SI
收藏

通过 graphops 研究稀疏图上 GNN 的极限、逼近与尺寸可迁移性

Limits, approximation and size transferability for GNNs on sparse graphs via graphops

MIT(麻省理工学院)

Thien Le, Stefanie Jegelka

AI总结:

本文基于 graphops 算子极限理论分析 GNN 对不同尺寸图的可迁移性与逼近误差,给出统一适用于稠密图和稀疏图的定量界。

摘要:

图神经网络能否泛化到与其训练时不同的图,例如尺寸不同的图?在本工作中,我们从理论视角研究这一问题。尽管近期工作通过图极限(例如 graphon)建立了此类可迁移性和逼近结果,但这些结果只有在稠密图上才有非平凡的适用性。为涵盖经常遇到的稀疏图,例如有界度图或幂律图,我们采用对从图中导出的算子取极限的视角,例如构成 GNN 的聚合操作。这引出了最近提出的 graphops 极限概念(Backhausz 和 Szegedy,2022)。我们展示了算子视角如何使我们能够在一个正则性假设下,给出有限 GNN 与其在无限图上的极限之间距离的定量界,以及在具有共同结构性质但尺寸不同的图上运行的 GNN 之间距离的定量界;该正则性假设已在多种图序列上得到验证。我们的结果适用于稠密图和稀疏图,以及多种图极限概念。

英文摘要:

Can graph neural networks generalize to graphs that are different from the graphs they were trained on, e.g., in size? In this work, we study this question from a theoretical perspective. While recent work established such transferability and approximation results via graph limits, e.g., via graphons, these only apply non-trivially to dense graphs. To include frequently encountered sparse graphs such as bounded-degree or power law graphs, we take a perspective of taking limits of operators derived from graphs, such as the aggregation operation that makes up GNNs. This leads to the recently introduced limit notion of graphops (Backhausz and Szegedy, 2022). We demonstrate how the operator perspective allows us to develop quantitative bounds on the distance between a finite GNN and its limit on an infinite graph, as well as the distance between the GNN on graphs of different sizes that share structural properties, under a regularity assumption verified for various graph sequences. Our results hold for dense and sparse graphs, and various notions of graph limits.

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

↑