Generative Subgraph Contrast for Self-Supervised Graph Representation Learning

07/25/2022
by   Yuehui Han, et al.
0

Contrastive learning has shown great promise in the field of graph representation learning. By manually constructing positive/negative samples, most graph contrastive learning methods rely on the vector inner product based similarity metric to distinguish the samples for graph representation. However, the handcrafted sample construction (e.g., the perturbation on the nodes or edges of the graph) may not effectively capture the intrinsic local structures of the graph. Also, the vector inner product based similarity metric cannot fully exploit the local structures of the graph to characterize the graph difference well. To this end, in this paper, we propose a novel adaptive subgraph generation based contrastive learning framework for efficient and robust self-supervised graph representation learning, and the optimal transport distance is utilized as the similarity metric between the subgraphs. It aims to generate contrastive samples by capturing the intrinsic structures of the graph and distinguish the samples based on the features and structures of subgraphs simultaneously. Specifically, for each center node, by adaptively learning relation weights to the nodes of the corresponding neighborhood, we first develop a network to generate the interpolated subgraph. We then construct the positive and negative pairs of subgraphs from the same and different nodes, respectively. Finally, we employ two types of optimal transport distances (i.e., Wasserstein distance and Gromov-Wasserstein distance) to construct the structured contrastive loss. Extensive node classification experiments on benchmark datasets verify the effectiveness of our graph contrastive learning method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/16/2021

Self-Supervised Dynamic Graph Representation Learning via Temporal Subgraph Contrast

Self-supervised learning on graphs has recently drawn a lot of attention...
research
08/31/2023

Contrastive Representation Learning Based on Multiple Node-centered Subgraphs

As the basic element of graph-structured data, node has been recognized ...
research
09/28/2022

Non-contrastive approaches to similarity learning: positive examples are all you need

The similarity learning problem in the oil & gas industry aims to constr...
research
07/11/2020

Representation Learning via Adversarially-Contrastive Optimal Transport

In this paper, we study the problem of learning compact (low-dimensional...
research
02/27/2019

Representation Learning with Weighted Inner Product for Universal Approximation of General Similarities

We propose weighted inner product similarity (WIPS) for neural-network b...
research
11/04/2021

Hard Negative Sampling via Regularized Optimal Transport for Contrastive Representation Learning

We study the problem of designing hard negative sampling distributions f...
research
07/02/2020

Maximizing Cohesion and Separation in Graph Representation Learning: A Distance-aware Negative Sampling Approach

The objective of unsupervised graph representation learning (GRL) is to ...

Please sign up or login with your details

Forgot password? Click here to reset