Communication Dans Un Congrès Année : 2024

Variational Graph Contrastive Learning

Résumé

Graph representation learning (GRL) is a fundamental task in machine learning, aiming to encode high-dimensional graph-structured data into low-dimensional vectors. Self-supervised learning (SSL) methods are widely used in GRL because they can avoid expensive human annotation. In this work, we propose a novel Subgraph Gaussian Embedding Contrast (SGEC) method. Our approach introduces a subgraph Gaussian embedding module, which adaptively maps subgraphs to a structured Gaussian space, ensuring the preservation of graph characteristics while controlling the distribution of generated subgraphs. We employ optimal transport distances, including Wasserstein and Gromov-Wasserstein distances, to effectively measure the similarity between subgraphs, enhancing the robustness of the contrastive learning process. Extensive experiments across multiple benchmarks demonstrate that SGEC outperforms or presents competitive performance against state-of-the-art approaches. Our findings provide insights into the design of SSL methods for GRL, emphasizing the importance of the distribution of the generated contrastive pairs.

Fichier principal
Vignette du fichier
24_Variational_Graph_Contrasti.pdf (1.64 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05167525 , version 1 (17-07-2025)

Licence

Identifiants

Citer

Shifeng Xie, Jhony H. Giraldo. Variational Graph Contrastive Learning. NeurIPS 2024 Workshop: Self-Supervised Learning-Theory and Practice, Dec 2024, Vancouver, Canada. ⟨hal-05167525⟩
1206 Consultations
166 Téléchargements

Altmetric

Partager

  • More