Information-aware graph contrastive learning
A method for performing contrastive learning for graph tasks and datasets by employing an information-aware graph contrastive learning framework is presented. The method includes obtaining two semantically similar views of a graph coupled with a label for training by employing a view augmentation component, feeding the two semantically similar views into respective encoder networks to extract latent representations preserving both structure and attribute information in the two views, optimizing a contrastive loss based on a contrastive mode by maximizing feature consistency between the latent representations, training a neural network with the optimized contrastive loss, and predicting a new graph label or a new node label in the graph.
1 . A method for performing contrastive learning for graph tasks and datasets by employing an information-aware graph contrastive learning framework, the method comprising:
obtaining two semantically similar views of a graph coupled with a label for training by employing a view augmentation component to generate views of the graph that do not affect a semantic label of the graph;
feeding the two semantically similar views into respective separate instances of encoder networks to extract latent representations preserving both structure and attribute information in the two semantically similar views;
selecting a contrastive mode that is characterized by an aggregation operation by solving an optimization problem:
(
c
i
*
,
c
j
*
)
=
argmin
(
c
i
*
,
c
j
*
)
-
I
(
c
i
(
z
i
*
)
;
c
j
(
z
j
*
)
)
where c*i and c*j are aggregation operations applied to latent representations z*i and z*j and where I(.;.) is a mutual information;
minimizing a contrastive loss based on the contrastive mode by maximizing feature consistency between the latent representations;
training a neural network by performing graph contrastive learning with the minimized contrastive loss; and
predicting a new graph label or a new node label in the graph using the neural network trained by the graph contrastive learning, wherein the predictive new graph label or new node label is used to support a decision making process.
2 . The method of claim 1 , wherein each of the separate instances of encoder networks includes a graph neural network (GNN) backbone and a projection multilayer perceptron (MLP).
3 . The method of claim 1 , wherein the contrastive mode is selected from the group consisting of a global-global mode, a local-global mode, a local-local mode, a multi-scale mode, and a hybrid-mode.
4 . The method of claim 3 , wherein, in the global-global mode, graph representations from the two semantically similar views are contrasted.
5 . The method of claim 3 , wherein, in the local-global mode, node representations from the first view of the two semantically similar views are contrasted with graph representations from the second view of the two semantically similar views.
6 . The method of claim 3 , wherein, in the local-local mode, node representations from the two semantically similar views are contrasted.
7 . The method of claim 1 , wherein the new graph label and the new node label are classified as either positive or negative.
8 . A non-transitory computer-readable storage medium comprising a computer-readable program for performing contrastive learning for graph tasks and datasets by employing an information-aware graph contrastive learning framework, wherein the computer-readable program when executed on a computer causes the computer to perform the steps of:
obtaining two semantically similar views of a graph coupled with a label for training by employing a view augmentation component to generate views of the graph that do not affect a semantic label of the graph;
feeding the two semantically similar views into respective separate instances of encoder networks to extract latent representations preserving both structure and attribute information in the two semantically similar views;
selecting a contrastive mode that is characterized by an aggregation operation by solving an optimization problem:
(
c
i
*
,
c
j
*
)
=
argmin
(
c
i
*
,
c
j
*
)
-
I
(
c
i
(
z
i
*
)
;
c
j
(
z
j
*
)
)
where c*i and c*j are aggregation operations applied to latent representations z*i and z*j and where I(.;.) is a mutual information;
minimizing a contrastive loss based on the contrastive mode by maximizing feature consistency between the latent representations;
training a neural network by performing graph contrastive learning with the minimized contrastive loss; and
predicting a new graph label or a new node label in the graph using the neural network trained by the graph contrastive learning, wherein the predictive new graph label or new node label is used to support a decision making process.
9 . The non-transitory computer-readable storage medium of claim 8 , wherein each of the separate instances of encoder networks includes a graph neural network (GNN) backbone and a projection multilayer perceptron (MLP).
10 . The non-transitory computer-readable storage medium of claim 8 , wherein the contrastive mode is selected from the group consisting of a global-global mode, a local-global mode, a local-local mode, a multi-scale mode, and a hybrid-mode.
11 . The non-transitory computer-readable storage medium of claim 10 , wherein, in the global-global mode, graph representations from the two semantically similar views are contrasted.
12 . The non-transitory computer-readable storage medium of claim 10 , wherein, in the local-global mode, node representations from the first view of the two semantically similar views are contrasted with graph representations from the second view of the two semantically similar views.
13 . The non-transitory computer-readable storage medium of claim 10 , wherein, in the local-local mode, node representations from the two semantically similar views are contrasted.
14 . The non-transitory computer-readable storage medium of claim 8 , wherein the new graph label and the new node label are classified as either positive or negative.
15 . A system for performing contrastive learning for graph tasks and datasets by employing an information-aware graph contrastive learning framework, the system comprising:
a memory; and
one or more processors in communication with the memory configured to:
obtain two semantically similar views of a graph coupled with a label for training by employing a view augmentation component to generate views of the graph that do not affect a semantic label of the graph;
feed the two semantically similar views into respective separate instances of encoder networks to extract latent representations preserving both structure and attribute information in the two semantically similar views;
select a contrastive mode that is characterized by an aggregation operation by solving an optimization problem:
(
c
i
*
,
c
j
*
)
=
argmin
(
c
i
*
,
c
j
*
)
-
I
(
c
i
(
z
i
*
)
;
c
j
(
z
j
*
)
)
where c*i and c*j are aggregation operations applied to latent representations z*i and z*j and where I(.;.) is a mutual information;
minimize a contrastive loss based on the contrastive mode by maximizing feature consistency between the latent representations;
train a neural network by performing graph contrastive learning with the minimized contrastive loss; and
predict a new graph label or a new node label in the graph using the neural network trained by the graph contrastive learning, wherein the predictive new graph label or new node label is used to support a decision making process.
16 . The system of claim 15 , wherein each of the separate instances of encoder networks includes a graph neural network (GNN) backbone and a projection multilayer perceptron (MLP).
17 . The system of claim 15 , wherein the contrastive mode is selected from the group consisting of a global-global mode, a local-global mode, a local-local mode, a multi-scale mode, and a hybrid-mode.
18 . The system of claim 17 , wherein, in the global-global mode, graph representations from the two semantically similar views are contrasted.
19 . The system of claim 17 , wherein, in the local-global mode, node representations from the first view of the two semantically similar views are contrasted with graph representations from the second view of the two semantically similar views.
20 . The system of claim 17 , wherein, in the local-local mode, node representations from the two semantically similar views are contrasted.