Contrastive Graph Representation Learning with Adversarial Cross-view Reconstruction and Information Bottleneck
Graph Neural Networks (GNNs) have received extensive research attention due to their powerful information aggregation capabilities. Despite the success of GNNs, most of them suffer from the popularity bias issue in a graph caused by a small number of popular categories. Additionally, real graph datasets always contain incorrect node labels, which hinders GNNs from learning effective node representations. Graph contrastive learning (GCL) has been shown to be effective in solving the above problems for node classification tasks. Most existing GCL methods are implemented by randomly removing edges and nodes to create multiple contrasting views, and then maximizing the mutual information (MI) between these contrasting views to improve the node feature representation. However, maximizing the mutual information between multiple contrasting views may lead the model to learn some redundant information irrelevant to the node classification task. To tackle this issue, we propose an effective Contrastive Graph Representation Learning with Adversarial Cross-view Reconstruction and Information Bottleneck (CGRL) for node classification, which can adaptively learn to mask the nodes and edges in the graph to obtain the optimal graph structure representation. Furthermore, we innovatively introduce the information bottleneck theory into GCLs to remove redundant information in multiple contrasting views while retaining as much information as possible about node classification. Moreover, we add noise perturbations to the original views and reconstruct the augmented views by constructing adversarial views to improve the robustness of node feature representation. Extensive experiments on real-world public datasets demonstrate that our method significantly outperforms existing state-of-the-art algorithms.
Code (0)
등록된 구현이 없습니다.
Tasks
Contrastive LearningGraph Representation LearningNode ClassificationRepresentation LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Graph Contrastive Learning with Cross-view Reconstruction
Among different existing graph self-supervised learning strategies, graph contrastive learning (GCL) has been one of the most prevalent approaches to this problem. Despite the remarkable performance those GCL methods hav…
Contrastive LearningDisentanglementGraph ClassificationGraph Learning+1Spatial-Temporal Graph Learning with Adversarial Contrastive Adaptation
Spatial-temporal graph learning has emerged as a promising solution for modeling structured spatial-temporal data and learning region representations for various urban sensing tasks such as crime forecasting and traffic …
Contrastive LearningGraph LearningSelf-Supervised LearningUnsupervised Graph Poisoning Attack via Contrastive Loss Back-propagation
Graph contrastive learning is the state-of-the-art unsupervised graph representation learning framework and has shown comparable performance with supervised approaches. However, evaluating whether the graph contrastive l…
Adversarial AttackContrastive LearningGraph Representation LearningLink Prediction+2Graph Contrastive Learning with Generative Adversarial Network
Graph Neural Networks (GNNs) have demonstrated promising results on exploiting node representations for many downstream tasks through supervised end-to-end training. To deal with the widespread label scarcity issue in re…
Contrastive LearningData AugmentationGenerative Adversarial NetworkGraph Representation Learning+2GPS: Graph Contrastive Learning via Multi-scale Augmented Views from Adversarial Pooling
Self-supervised graph representation learning has recently shown considerable promise in a range of fields, including bioinformatics and social networks. A large number of graph contrastive learning approaches have shown…
Adversarial RobustnessContrastive LearningGraph ClassificationGraph Representation Learning+2