arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.02732cs.LGcs.DS
收藏

GEFL:用于图分类的扩展过滤学习

GEFL: Extended Filtration Learning for Graph Classification

Purdue University(普渡大学)

Simon Zhang, Soham Mukherjee, Tamal K. Dey

AI总结:

本文提出将扩展持久性引入图分类的监督学习框架,利用link-cut tree和并行机制将计算速度提升超60倍,使模型端到端可微且能捕获全局拓扑信息,在表达能力和真实数据集上均优于现有方法。

摘要:

扩展持久性是拓扑数据分析中的一种技术,用于从图中获取全局多尺度拓扑信息。这包括由所谓持久性条形码捕获的连通分量和循环信息。我们将扩展持久性引入到用于图分类的监督学习框架中。全局拓扑信息以包含四种不同类型条形码及其显式循环代表的形式,通过由扩展持久性计算的读出函数整合到模型中。整个模型是端到端可微的。我们使用link-cut tree数据结构和并行机制来降低计算扩展持久性的复杂度,在扩展持久性计算方面比现有最优方法获得了超过60倍的加速。这使得扩展持久性在机器学习中变得可行。我们证明,在特定条件下,扩展持久性在表达能力上超越了WL[1]图同构测试和0维条形码,因为它增加了更多全局(拓扑)信息。特别是,它可以表示任意长度的循环,这对于有限感受野的消息传递图神经网络是很困难的。此外,我们展示了与许多现有的最新图表示学习方法相比,该方法在真实世界数据集上的有效性。

英文摘要:

Extended persistence is a technique from topological data analysis to obtain global multiscale topological information from a graph. This includes information about connected components and cycles that are captured by the so-called persistence barcodes. We introduce extended persistence into a supervised learning framework for graph classification. Global topological information, in the form of a barcode with four different types of bars and their explicit cycle representatives, is combined into the model by the readout function which is computed by extended persistence. The entire model is end-to-end differentiable. We use a link-cut tree data structure and parallelism to lower the complexity of computing extended persistence, obtaining a speedup of more than 60x over the state-of-the-art for extended persistence computation. This makes extended persistence feasible for machine learning. We show that, under certain conditions, extended persistence surpasses both the WL[1] graph isomorphism test and 0-dimensional barcodes in terms of expressivity because it adds more global (topological) information. In particular, arbitrarily long cycles can be represented, which is difficult for finite receptive field message passing graph neural networks. Furthermore, we show the effectiveness of our method on real world datasets compared to many existing recent graph representation learning methods.

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

↑