Union subgraph neural networks

Graph Neural Networks (GNNs) are widely used for graph representation learning in many application domains. The expressiveness of vanilla GNNs is upper-bounded by 1-dimensional Weisfeiler-Leman (1-WL) test as they operate on rooted subtrees through iterative message passing. In this paper, we empowe...

Full description

Saved in:
Bibliographic Details
Main Authors: Xu, Jiaxing, Zhang, Aihu, Bian, Qingtian, Dwivedi, Vijay Prakash, Ke, Yiping
Other Authors: School of Computer Science and Engineering
Format: Conference or Workshop Item
Language:English
Published: 2024
Subjects:
Online Access:https://hdl.handle.net/10356/173329
https://aaai.org/aaai-conference/
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-173329
record_format dspace
spelling sg-ntu-dr.10356-1733292024-03-08T15:35:26Z Union subgraph neural networks Xu, Jiaxing Zhang, Aihu Bian, Qingtian Dwivedi, Vijay Prakash Ke, Yiping School of Computer Science and Engineering The 38th AAAI Conference on Artificial Intelligence (AAAI 2024) Computational Intelligence Lab (CIL) Computer and Information Science Graph Neural Networks Weisfeiler-Leman Test Message-Passing Neural Networks Graph Neural Networks (GNNs) are widely used for graph representation learning in many application domains. The expressiveness of vanilla GNNs is upper-bounded by 1-dimensional Weisfeiler-Leman (1-WL) test as they operate on rooted subtrees through iterative message passing. In this paper, we empower GNNs by injecting neighbor-connectivity information extracted from a new type of substructure. We first investigate different kinds of connectivities existing in a local neighborhood and identify a substructure called union subgraph, which is able to capture the complete picture of the 1-hop neighborhood of an edge. We then design a shortest-path-based substructure descriptor that possesses three nice properties and can effectively encode the high-order connectivities in union subgraphs. By infusing the encoded neighbor connectivities, we propose a novel model, namely Union Subgraph Neural Network (UnionSNN), which is proven to be strictly more powerful than 1-WL in distinguishing non-isomorphic graphs. Additionally, the local encoding from union subgraphs can also be injected into arbitrary message-passing neural networks (MPNNs) and Transformer-based models as a plugin. Extensive experiments on 18 benchmarks of both graph-level and node-level tasks demonstrate that UnionSNN outperforms state-of-the-art baseline models, with competitive computational efficiency. The injection of our local encoding to existing models is able to boost the performance by up to 11.09%. Our code is available at https://github.com/AngusMonroe/UnionSNN. Ministry of Education (MOE) National Research Foundation (NRF) Submitted/Accepted version This research/project is supported by the National Research Foundation, Singapore under its Industry Alignment Fund – Pre-positioning (IAF-PP) Funding Initiative, and the Ministry of Education, Singapore under its MOE Academic Research Fund Tier 2 (STEM RIE2025 Award MOE-T2EP20220-0006). 2024-03-06T02:04:39Z 2024-03-06T02:04:39Z 2024 Conference Paper Xu, J., Zhang, A., Bian, Q., Dwivedi, V. P. & Ke, Y. (2024). Union subgraph neural networks. The 38th AAAI Conference on Artificial Intelligence (AAAI 2024), 38. https://hdl.handle.net/10356/173329 https://aaai.org/aaai-conference/ 38 en IAF-PP MOE-T2EP20220-0006 © 2024 Association for the Advancement of Artifcial Intelligence. All rights reserved. This article may be downloaded for personal use only. Any other use requires prior permission of the copyright holder. The Version of Record is available online at https://ojs.aaai.org/index.php/AAAI/issue/archive. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Computer and Information Science
Graph Neural Networks
Weisfeiler-Leman Test
Message-Passing Neural Networks
spellingShingle Computer and Information Science
Graph Neural Networks
Weisfeiler-Leman Test
Message-Passing Neural Networks
Xu, Jiaxing
Zhang, Aihu
Bian, Qingtian
Dwivedi, Vijay Prakash
Ke, Yiping
Union subgraph neural networks
description Graph Neural Networks (GNNs) are widely used for graph representation learning in many application domains. The expressiveness of vanilla GNNs is upper-bounded by 1-dimensional Weisfeiler-Leman (1-WL) test as they operate on rooted subtrees through iterative message passing. In this paper, we empower GNNs by injecting neighbor-connectivity information extracted from a new type of substructure. We first investigate different kinds of connectivities existing in a local neighborhood and identify a substructure called union subgraph, which is able to capture the complete picture of the 1-hop neighborhood of an edge. We then design a shortest-path-based substructure descriptor that possesses three nice properties and can effectively encode the high-order connectivities in union subgraphs. By infusing the encoded neighbor connectivities, we propose a novel model, namely Union Subgraph Neural Network (UnionSNN), which is proven to be strictly more powerful than 1-WL in distinguishing non-isomorphic graphs. Additionally, the local encoding from union subgraphs can also be injected into arbitrary message-passing neural networks (MPNNs) and Transformer-based models as a plugin. Extensive experiments on 18 benchmarks of both graph-level and node-level tasks demonstrate that UnionSNN outperforms state-of-the-art baseline models, with competitive computational efficiency. The injection of our local encoding to existing models is able to boost the performance by up to 11.09%. Our code is available at https://github.com/AngusMonroe/UnionSNN.
author2 School of Computer Science and Engineering
author_facet School of Computer Science and Engineering
Xu, Jiaxing
Zhang, Aihu
Bian, Qingtian
Dwivedi, Vijay Prakash
Ke, Yiping
format Conference or Workshop Item
author Xu, Jiaxing
Zhang, Aihu
Bian, Qingtian
Dwivedi, Vijay Prakash
Ke, Yiping
author_sort Xu, Jiaxing
title Union subgraph neural networks
title_short Union subgraph neural networks
title_full Union subgraph neural networks
title_fullStr Union subgraph neural networks
title_full_unstemmed Union subgraph neural networks
title_sort union subgraph neural networks
publishDate 2024
url https://hdl.handle.net/10356/173329
https://aaai.org/aaai-conference/
_version_ 1794549282184888320