← Search

bingxin niu

8 accepted papers

2024

Improving Graph Contrastive Learning via Adaptive Positive Sampling

CVPR 2024poster

Graph Contrastive Learning (GCL) a Self-Supervised Learning (SSL) architecture tailored for graphs has shown notable potential for mitigating label scarcity. Its core idea is to amplify feature similarities between the positive sample pairs and reduce them between the negative sample pairs. Unfortun…

Cited by 5SourcePDFScholar
2024

Unified Graph Augmentations for Generalized Contrastive Learning on Graphs

NeurIPS 2024poster

In real-world scenarios, networks (graphs) and their tasks possess unique characteristics, requiring the development of a versatile graph augmentation (GA) to meet the varied demands of network analysis. Unfortunately, most Graph Contrastive Learning (GCL) frameworks are hampered by the specificity,…

Cited by 1SourcePDFScholar
2023

Self-supervised Graph Neural Networks via Low-Rank Decomposition

NeurIPS 2023poster

Self-supervised learning is introduced to train graph neural networks (GNNs) by employing propagation-based GNNs designed for semi-supervised learning tasks. Unfortunately, this common choice tends to cause two serious issues. Firstly, global parameters cause the model lack the ability to capture th…

Cited by 14SourcePDFScholar
2022

OPEN: Orthogonal Propagation with Ego-Network Modeling

NeurIPS 2022accept

To alleviate the unfavorable effect of noisy topology in Graph Neural networks (GNNs), some efforts perform the local topology refinement through the pairwise propagation weight learning and the multi-channel extension. Unfortunately, most of them suffer a common and fatal drawback: irrelevant propa…

Cited by 7SourcePDFScholar
2022

Self-Supervised Graph Neural Networks via Diverse and Interactive Message Passing

AAAI 2022technical

By interpreting Graph Neural Networks (GNNs) as the message passing from the spatial perspective, their success is attributed to Laplacian smoothing. However, it also leads to serious over-smoothing issue by stacking many layers. Recently, many efforts have been paid to overcome this issue in semi-s…

Cited by 12SourcePDFScholar
2021

Diverse Message Passing for Attribute with Heterophily

NeurIPS 2021poster

Most of the existing GNNs can be modeled via the Uniform Message Passing framework. This framework considers all the attributes of each node in its entirety, shares the uniform propagation weights along each edge, and focuses on the uniform weight learning. The design of this framework possesses tw…

Cited by 83SourcePDFScholar
2021

Heterogeneous Graph Information Bottleneck

IJCAI 2021poster

Most attempts on extending Graph Neural Networks (GNNs) to Heterogeneous Information Networks (HINs) implicitly take the direct assumption that the multiple homogeneous attributed networks induced by different meta-paths are complementary. The doubts about the hypothesis of complementary motivate…

Cited by 33SourcePDFScholar
2021

Why Do Attributes Propagate in Graph Convolutional Neural Networks?

AAAI 2021technical

Many efforts have been paid to enhance Graph Convolutional Network from the perspective of propagation under the philosophy that ``Propagation is the essence of the GCNNs". Unfortunately, its adverse effect is over-smoothing, which makes the performance dramatically drop. To prevent the over-smoothi…

Cited by 35SourcePDFScholar