mlsanityData to 14 Oct 2026

MUSE: Multi-View Contrastive Learning for Heterophilic Graphs

arXiv 2307.16026 ↗First posted 29 Jul 2023cs.LG cs.SIcited by 13

Not on the map. Why?

Abstract (arXiv)

In recent years, self-supervised learning has emerged as a promising approach in addressing the issues of label dependency and poor generalization performance in traditional GNNs. However, existing self-supervised methods have limited effectiveness on heterophilic graphs, due to the homophily assumption that results in similar node representations for connected nodes. In this work, we propose a multi-view contrastive learning model for heterophilic graphs, namely, MUSE. Specifically, we construct two views to capture the information of the ego node and its neighborhood by GNNs enhanced with contrastive learning, respectively. Then we integrate the information from these two views to fuse the node representations. Fusion contrast is utilized to enhance the effectiveness of fused node representations. Further, considering that the influence of neighboring contextual information on information fusion may vary across different ego nodes, we employ an information fusion controller to model the diversity of node-neighborhood similarity at both the local and global levels. Finally, an alternating training scheme is adopted to ensure that unsupervised node representation learning and information fusion controller can mutually reinforce each other. We conduct extensive experiments to evaluate the performance of MUSE on 9 benchmark datasets. Our results show the effectiveness of MUSE on both node classification and clustering tasks.

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Builds on 38 of its 48 references that are in the map. First posted on arXiv 29 Jul 2023.

Builds on

38 of 48 references.

References · 38

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  4. 2017Graph Attention Networkscited by 8,923
  5. 2017Inductive Representation Learning on Large Graphscited by 6,320
  6. 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
  7. 2019Simplifying Graph Convolutional Networkscited by 1,477
  8. 2016Variational Graph Auto-Encoderscited by 1,382
  9. 2020Graph Contrastive Learning with Augmentationscited by 1,208
  10. 2018Deep Graph Infomaxcited by 1,106
  11. 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 993
  12. 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
26 more
  1. 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 877
  2. 2020Simple and Deep Graph Convolutional Networkscited by 860
  3. 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 826
  4. 2020Contrastive Multi-View Representation Learning on Graphscited by 652
  5. 2015LINE: Large-scale Information Network Embeddingcited by 582
  6. 2020Deep Graph Contrastive Representation Learningcited by 539
  7. 2020GCC: Graph Contrastive Coding for Graph Neural Network Pre-Trainingcited by 463
  8. 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 443
  9. 2019InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximizationcited by 441
  10. 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 362
  11. 2020Graph Representation Learning via Graphical Mutual Information Maximizationcited by 217
  12. 2017struc2vec: Learning Node Representations from Structural Identitycited by 215
  13. 2021Large-Scale Representation Learning on Graphs via Bootstrappingcited by 186
  14. 2021Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networkscited by 182
  15. 2021Is Homophily a Necessity for Graph Neural Networks?cited by 182
  16. 2022Finding Global Homophily in Graph Neural Networks When Meeting Heterophilycited by 179
  17. 2019Attributed Graph Clustering: A Deep Attentional Embedding Approachcited by 149
  18. 2020Structural Deep Clustering Networkcited by 145
  19. 2019Attributed Graph Clustering via Adaptive Graph Convolutioncited by 96
  20. 2021Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patternscited by 95
  21. 2019Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learningcited by 94
  22. 2020Non-Local Graph Neural Networkscited by 91
  23. 2021Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?cited by 82
  24. 2022Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminatingcited by 57
  25. 2019Semi-Implicit Graph Variational Auto-Encoderscited by 54
  26. 2022Graph Auto-Encoder Via Neighborhood Wasserstein Reconstructioncited by 28

Built on by

Cited by year

Citing papers per year: 2023: 4; 2024: 5; 2025: 4.

13 papers.

Sort:

By area: