DeepRicci: Self-supervised Graph Structure-Feature Co-Refinement for Alleviating Over-squashing
Graph Neural Networks (GNNs) have shown great power for learning and mining on graphs, and Graph Structure Learning (GSL) plays an important role in boosting GNNs with a refined graph. In the literature, most GSL solutions either primarily focus on structure refinement with task-specific supervision (i.e., node classification), or overlook the inherent weakness of GNNs themselves (e.g., over-squashing), resulting in suboptimal performance despite sophisticated designs. In light of these limitations, we propose to study self-supervised graph structure-feature co-refinement for effectively alleviating the issue of over-squashing in typical GNNs. In this paper, we take a fundamentally different perspective of the Ricci curvature in Riemannian geometry, in which we encounter the challenges of modeling, utilizing and computing Ricci curvature. To tackle these challenges, we present a self-supervised Riemannian model, DeepRicci. Specifically, we introduce a latent Riemannian space of heterogeneous curvatures to model various Ricci curvatures, and propose a gyrovector feature mapping to utilize Ricci curvature for typical GNNs. Thereafter, we refine node features by geometric contrastive learning among different geometric views, and simultaneously refine graph structure by backward Ricci flow based on a novel formulation of differentiable Ricci curvature. Finally, extensive experiments on public datasets show the superiority of DeepRicci, and the connection between backward Ricci flow and over-squashing. Codes of our work are given in https://github.com/RiemanGraph/.
Code (0)
등록된 구현이 없습니다.
Tasks
Contrastive LearningGraph structure learningNode ClassificationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Multi-task Self-distillation for Graph-based Semi-Supervised Learning
Graph convolutional networks have made great progress in graph-based semi-supervised learning. Existing methods mainly assume that nodes connected by graph edges are prone to have similar attributes and labels, so that t…
Node ClassificationSelf-supervised Consensus Representation Learning for Attributed Graph
Attempting to fully exploit the rich information of topological structure and node features for attributed graph, we introduce self-supervised learning mechanism to graph representation learning and propose a novel Self-…
Graph Representation LearningNode ClassificationRepresentation LearningSelf-Supervised LearningAnomal-E: A Self-Supervised Network Intrusion Detection System based on Graph Neural Networks
This paper investigates Graph Neural Networks (GNNs) application for self-supervised network intrusion and anomaly detection. GNNs are a deep learning approach for graph-based data that incorporate graph structures into …
Anomaly DetectionIntrusion DetectionNetwork Intrusion DetectionSeeGera: Self-supervised Semi-implicit Graph Variational Auto-encoders with Masking
Generative graph self-supervised learning (SSL) aims to learn node representations by reconstructing the input graph data. However, most existing methods focus on unsupervised learning tasks only and very few work has sh…
Contrastive LearningSelf-Supervised LearningVariational InferenceAdaptive Self-supervised Robust Clustering for Unstructured Data with Unknown Cluster Number
We introduce a novel self-supervised deep clustering approach tailored for unstructured data without requiring prior knowledge of the number of clusters, termed Adaptive Self-supervised Robust Clustering (ASRC). In parti…
ClusteringContrastive LearningDeep Clustering