TL;DR
This paper introduces a conditional distribution learning approach for graph classification that aligns augmented feature distributions to preserve semantic information and mitigates conflicts between message passing and contrastive learning.
Contribution
It proposes an end-to-end graph representation model that aligns distributions of augmented features, effectively balancing message passing and contrastive learning.
Findings
Improves graph classification accuracy on benchmark datasets.
Effectively preserves semantic information during augmentation.
Balances message passing with contrastive learning.
Abstract
Leveraging the diversity and quantity of data provided by various graph-structured data augmentations while preserving intrinsic semantic information is challenging. Additionally, successive layers in graph neural network (GNN) tend to produce more similar node embeddings, while graph contrastive learning aims to increase the dissimilarity between negative pairs of node embeddings. This inevitably results in a conflict between the message-passing mechanism (MPM) of GNNs and the contrastive learning (CL) of negative pairs via intraviews. In this paper, we propose a conditional distribution learning (CDL) method that learns graph representations from graph-structured data for semisupervised graph classification. Specifically, we present an end-to-end graph representation learning model to align the conditional distributions of weakly and strongly augmented features over the original…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGraph Neural Network · Contrastive Learning · ALIGN
