Permutation-Invariant Graph Partitioning:How Graph Neural Networks Capture Structural Interactions?

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Hevapathige, Asela, Wang, Qing
Natura: Preprint
Pubblicazione: 2023
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866913713600069632
author Hevapathige, Asela
Wang, Qing
author_facet Hevapathige, Asela
Wang, Qing
contents Graph Neural Networks (GNNs) have paved the way for being a cornerstone in graph-related learning tasks. Yet, the ability of GNNs to capture structural interactions within graphs remains under-explored. In this work, we address this gap by drawing on the insight that permutation invariant graph partitioning enables a powerful way of exploring structural interactions. We establish theoretical connections between permutation invariant graph partitioning and graph isomorphism, and then propose Graph Partitioning Neural Networks (GPNNs), a novel architecture that efficiently enhances the expressive power of GNNs in learning structural interactions. We analyze how partitioning schemes and structural interactions contribute to GNN expressivity and their trade-offs with complexity. Empirically, we demonstrate that GPNNs outperform existing GNN models in capturing structural interactions across diverse graph benchmark tasks.
format Preprint
id arxiv_https___arxiv_org_abs_2312_08671
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Permutation-Invariant Graph Partitioning:How Graph Neural Networks Capture Structural Interactions?
Hevapathige, Asela
Wang, Qing
Machine Learning
Artificial Intelligence
Graph Neural Networks (GNNs) have paved the way for being a cornerstone in graph-related learning tasks. Yet, the ability of GNNs to capture structural interactions within graphs remains under-explored. In this work, we address this gap by drawing on the insight that permutation invariant graph partitioning enables a powerful way of exploring structural interactions. We establish theoretical connections between permutation invariant graph partitioning and graph isomorphism, and then propose Graph Partitioning Neural Networks (GPNNs), a novel architecture that efficiently enhances the expressive power of GNNs in learning structural interactions. We analyze how partitioning schemes and structural interactions contribute to GNN expressivity and their trade-offs with complexity. Empirically, we demonstrate that GPNNs outperform existing GNN models in capturing structural interactions across diverse graph benchmark tasks.
title Permutation-Invariant Graph Partitioning:How Graph Neural Networks Capture Structural Interactions?
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2312.08671