LAC: Graph Contrastive Learning with Learnable Augmentation in Continuous Space
Graph Contrastive Learning frameworks have demonstrated success in generating high-quality node representations. The existing research on efficient data augmentation methods and ideal pretext tasks for graph contrastive learning remains limited, resulting in suboptimal node representation in the unsupervised setting. In this paper, we introduce LAC, a graph contrastive learning framework with learnable data augmentation in an orthogonal continuous space. To capture the representative information in the graph data during augmentation, we introduce a continuous view augmenter, that applies both a masked topology augmentation module and a cross-channel feature augmentation module to adaptively augment the topological information and the feature information within an orthogonal continuous space, respectively. The orthogonal nature of continuous space ensures that the augmentation process avoids dimension collapse. To enhance the effectiveness of pretext tasks, we propose an information-theoretic principle named InfoBal and introduce corresponding pretext tasks. These tasks enable the continuous view augmenter to maintain consistency in the representative information across views while maximizing diversity between views, and allow the encoder to fully utilize the representative information in the unsupervised setting. Our experimental results show that LAC significantly outperforms the state-of-the-art frameworks.
Code (0)
등록된 구현이 없습니다.
Tasks
Contrastive LearningData AugmentationDiversityMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Bringing Your Own View: Graph Contrastive Learning without Prefabricated Data Augmentations
Self-supervision is recently surging at its new frontier of graph learning. It facilitates graph representations beneficial to downstream tasks; but its success could hinge on domain knowledge for handcraft or the often …
Contrastive LearningGraph LearningAutoGCL: Automated Graph Contrastive Learning via Learnable View Generators
Contrastive learning has been widely applied to graph representation learning, where the view generators play a vital role in generating effective contrastive samples. Most of the existing contrastive learning methods em…
Contrastive LearningGraph Representation LearningRepresentation LearningSemantic Similarity+2GraphLearner: Graph Node Clustering with Fully Learnable Augmentation
Contrastive deep graph clustering (CDGC) leverages the power of contrastive learning to group nodes into different clusters. The quality of contrastive samples is crucial for achieving better performance, making augmenta…
AttributeClusteringContrastive LearningData Augmentation+3Adaptive Multi-view Graph Contrastive Learning via Fractional-order Neural Diffusion Networks
Graph contrastive learning (GCL) learns node and graph representations by contrasting multiple views of the same graph. Existing methods typically rely on fixed, handcrafted views-usually a local and a global perspective…
Contrastive LearningJointly Learnable Data Augmentations for Self-Supervised GNNs
Self-supervised Learning (SSL) aims at learning representations of objects without relying on manual labeling. Recently, a number of SSL methods for graph representation learning have achieved performance comparable to S…
Data AugmentationGraph Representation LearningNode ClassificationRepresentation Learning+1