Search Results for author:
Found 4 papers, 3 papers with code
Rethinking and Simplifying Bootstrapped Graph Latents
Graph contrastive learning (GCL) has emerged as a representative paradigm in graph self-supervised learning, where negative samples are commonly regarded as the key to preventing model collapse and producing distinguishable representations.
Oversmoothing: A Nightmare for Graph Contrastive Learning?
Oversmoothing is a common phenomenon observed in graph neural networks (GNNs), in which an increase in the network depth leads to a deterioration in their performance.
What's Behind the Mask: Understanding Masked Graph Modeling for Graph Autoencoders
The last years have witnessed the emergence of a promising self-supervised learning strategy, referred to as masked autoencoding.
FastGCL: Fast Self-Supervised Learning on Graphs via Contrastive Neighborhood Aggregation
Graph contrastive learning (GCL), as a popular approach to graph self-supervised learning, has recently achieved a non-negligible effect.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
