IP Library › Granted Patent US 12,511,540
Granted Patent B2
US 12,511,540 · App. 18/484,862 · Granted Dec 30, 2025

Information-aware graph contrastive learning

Inventors: Wei Cheng (Princeton Junction, NJ); Dongkuan Xu (State College, PA); Haifeng Chen (West Windsor, NJ)
Assignee: NEC Corporation
G06N3/08
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,511,540
App. No.
18/484,862
Granted
Dec 30, 2025
Kind
B2
Abstract

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.

Claims (150)

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;

selecting a contrastive mode that is characterized by an aggregation operation by solving an optimization problem:

(

c

i

*

,

c

j

*

)

=

arg

⁢

min

(

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 from respective separate instances of encoder networks and where I(.;.) is a mutual information;

minimizing a contrastive loss based on the contrastive mode by maximizing feature consistency between the latent representations; and

training a document classification model by performing graph contrastive learning with the minimized contrastive loss;

predicting a new node label of a new technical paper based on citation information and textual content of the new technical paper using the document classification model trained by performing graph contrastive learning, the graph representing a citation network indicating citation between technical papers with nodes each indicating the technical papers, the label indicating a research area, the document classification model being trained in such a way that the document classification model predicts the new node label of the new technical paper based on the citation information and the textual content of the new technical paper, wherein the predicted new node label is used to support a decision making process.

2 . The method of claim 1 , further comprising: feeding the two semantically similar views into the respective separate instances of encoder networks to extract latent representations preserving both structure and attribute information in the two semantically similar views.

3 . The method of claim 2 , wherein each of the respective separate instances of encoder networks includes a graph neural network (GNN) backbone and a projection multilayer perceptron (MLP).

4 . 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.

5 . The method of claim 4 , wherein, in the global-global mode, graph representations from the two semantically similar views are contrasted.

6 . The method of claim 4 , 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.

7 . The method of claim 4 , wherein, in the local-local mode, node representations from the two semantically similar views are contrasted.

8 . The method of claim 1 , wherein the new node label is classified as either positive or negative.

9 . 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;

selecting a contrastive mode that is characterized by an aggregation operation by solving an optimization problem:

(

c

i

*

,

c

j

*

)

=

arg

⁢

min

(

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 from respective separate instances of encoder networks and where I(.;.) is a mutual information;

minimizing a contrastive loss based on the contrastive mode by maximizing feature consistency between the latent representations; and

training a document classification model by performing graph contrastive learning with the minimized contrastive loss;

predicting a new node label of a new technical paper based on citation information and textual content of the new technical paper using the document classification model trained by performing graph contrastive learning, the graph representing a citation network indicating citation between technical papers with nodes each indicating the technical papers, the label indicating a research area, the document classification model being trained in such a way that the document classification model predicts the new node label of the new technical paper based on the citation information and the textual content of the new technical paper, wherein the predicted new node label is used to support a decision making process.

10 . 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;

select a contrastive mode that is characterized by an aggregation operation by solving an optimization problem:

(

c

i

*

,

c

j

*

)

=

arg

⁢

min

(

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 from respective separate instances of encoder networks and where I(.;.) is a mutual information;

minimize a contrastive loss based on the contrastive mode by maximizing feature consistency between the latent representations; and

train a document classification model by performing graph contrastive learning with the minimized contrastive loss;

predict a new node label of a new technical paper based on citation information and textual content of the new technical paper using the document classification model trained by performing graph contrastive learning, the graph representing a citation network indicating citation between technical papers with nodes each indicating the technical papers, the label indicating a research area, the document classification model being trained in such a way that the document classification model predicts the new node label of the new technical paper based on the citation information and the textual content of the new technical paper, wherein the predicted new node label is used to support a decision making process.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 18, 2025
From: NEC LABORATORIES AMERICA, INC.
To: NEC CORPORATION
Reel/Frame 072938/0913 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 25, 2025
From: CHENG, WEI; XU, DONGKUAN; CHEN, HAIFENG
To: NEC LABORATORIES AMERICA, INC.
Reel/Frame 070617/0858 →
Continuity (4)
Continuation 17728071 · Apr 25, 2022
Provisional Application 63316505 · Mar 4, 2022
Provisional Application 63191367 · May 21, 2021
Related Publication 20240037402A1 · Feb 1, 2024
References Cited (13)
US 5289303A · Cloonan · 1994 [cited by examiner]
US 20150363702A1 · Baum · 2015 [cited by examiner]
US 20170124711A1 · Chandraker · 2017 [cited by examiner]
US 20190034798A1 · Yu · 2019 [cited by examiner]
US 20190095806A1 · Martinez Canedo · 2019 [cited by examiner]
US 20200242507A1 · Gan · 2020 [cited by examiner]
US 20210064931A1 · Yang · 2021 [cited by examiner]
US 20210110262A1 · Schmitt · 2021 [cited by examiner]
US 20210326660A1 · Krishnan · 2021 [cited by examiner]
US 20220156591A1 · Li · 2022 [cited by examiner]
WO WO2017031356A1 · 2017 [cited by examiner]
ÂGlocalized Weisfeiler-Lehman Graph Kernals: Global-Local Feature Maps of Graphsâ IEEE Internation Conference on Data Mining, 2017, pp. 327-336 (Year: 2017). [cited by examiner]
ÂGraph Contrastive Learning With Augmentationsâ, arXiv:201, 13902v3[cs. LG], pp. 1-12, Apr. 2021 (Year: 2021). [cited by examiner]