Beyond Redundancy: Information-aware Unsupervised Multiplex Graph Structure Learning
Zhixiang Shen, Shuo Wang, Zhao Kang

TL;DR
This paper introduces InfoMGF, an unsupervised framework for learning fused multiplex graph structures that retain task-relevant information while removing noise, outperforming existing methods including supervised approaches.
Contribution
Proposes a novel unsupervised graph fusion method that refines structure to preserve task-relevant info and eliminate noise, with theoretical guarantees and superior empirical results.
Findings
Outperforms baseline methods on various downstream tasks.
Surpasses some supervised approaches in accuracy.
Demonstrates robustness across different datasets.
Abstract
Unsupervised Multiplex Graph Learning (UMGL) aims to learn node representations on various edge types without manual labeling. However, existing research overlooks a key factor: the reliability of the graph structure. Real-world data often exhibit a complex nature and contain abundant task-irrelevant noise, severely compromising UMGL's performance. Moreover, existing methods primarily rely on contrastive learning to maximize mutual information across different graphs, limiting them to multiplex graph redundant scenarios and failing to capture view-unique task-relevant information. In this paper, we focus on a more realistic and challenging task: to unsupervisedly learn a fused graph from multiple graphs that preserve sufficient task-relevant information while removing task-irrelevant noise. Specifically, our proposed Information-aware Unsupervised Multiplex Graph Fusion framework…
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
Taxonomy
TopicsAdvanced Graph Neural Networks
MethodsFocus · Contrastive Learning
