TL;DR
This paper introduces a soft-mask GNN layer that adaptively extracts task-relevant substructures from graphs, improving performance and interpretability by focusing on important parts and ignoring noise.
Contribution
It proposes a differentiable soft-mask mechanism for flexible subgraph extraction in GNNs, enabling hierarchical and task-specific structure learning beyond fixed sampling methods.
Findings
Improves graph classification accuracy on benchmark datasets.
Provides interpretable mask visualizations of learned structures.
Outperforms existing subgraph and pooling methods.
Abstract
For learning graph representations, not all detailed structures within a graph are relevant to the given graph tasks. Task-relevant structures can be or which are only involved in subgraphs or characterized by the interactions of subgraphs (a hierarchical perspective). A graph neural network should be able to efficiently extract task-relevant structures and be invariant to irrelevant parts, which is challenging for general message passing GNNs. In this work, we propose to learn graph representations from a sequence of subgraphs of the original graph to better capture task-relevant substructures or hierarchical structures and skip parts. To this end, we design soft-mask GNN layer to extract desired subgraphs through the mask mechanism. The soft-mask is defined in a continuous space to maintain the differentiability and characterize the weights of different…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGraph Neural Network
