GEFL: Extended Filtration Learning for Graph ClassificationDownload PDF

Published: 24 Nov 2022, Last Modified: 23 Mar 2025LoG 2022 PosterReaders: Everyone
Keywords: Graph Classification, Cycles, Graph Neural Networks
TL;DR: Using the extended persistence algorithm, we obtain a graph representation from its cycles and connected components as well as the explicit cycle representatives of a cycle basis.
Abstract: 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.
Type Of Submission: Full paper proceedings track submission (max 9 main pages).
Agreement: Check this if you are okay with being contacted to participate in an anonymous survey.
PDF File: pdf
Supplementary Materials: zip
Type Of Submission: Full paper proceedings track submission.
Software: https://github.com/simonzhang00/GraphExtendedFiltrationLearning
Poster: png
Poster Preview: png
Community Implementations: [![CatalyzeX](/images/catalyzex_icon.svg) 1 code implementation](https://www.catalyzex.com/paper/gefl-extended-filtration-learning-for-graph/code)
6 Replies

Loading