Differentiable Meta Multigraph Search with Partial Message Propagation on Heterogeneous Information Networks
Chao Li, Hao Xu, Kun He

TL;DR
This paper introduces a differentiable search method for neural architectures on heterogeneous information networks, improving stability and flexibility over existing approaches by learning complex semantic relations.
Contribution
It proposes Partial Message Meta Multigraph search (PMMM), a novel differentiable framework that automatically finds meaningful, flexible meta multigraphs for heterogeneous GNNs, surpassing manual designs.
Findings
Outperforms state-of-the-art heterogeneous GNNs on benchmark tasks
Finds meaningful and complex meta multigraphs
Demonstrates improved stability over existing methods
Abstract
Heterogeneous information networks (HINs) are widely employed for describing real-world data with intricate entities and relationships. To automatically utilize their semantic information, graph neural architecture search has recently been developed on various tasks of HINs. Existing works, on the other hand, show weaknesses in instability and inflexibility. To address these issues, we propose a novel method called Partial Message Meta Multigraph search (PMMM) to automatically optimize the neural architecture design on HINs. Specifically, to learn how graph neural networks (GNNs) propagate messages along various types of edges, PMMM adopts an efficient differentiable framework to search for a meaningful meta multigraph, which can capture more flexible and complex semantic relations than a meta graph. The differentiable search typically suffers from performance instability, so we further…
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.
Videos
Taxonomy
TopicsAdvanced Graph Neural Networks · Graph Theory and Algorithms · Topic Modeling
