78 citations · 277 across the 32 of their papers we have counts for
6 papers · 1 filter
Towards Generalizable Graph Contrastive Learning: An Information Theory Perspective
Yige Yuan, Bingbing Xu, Huawei Shen +4
Graph contrastive learning (GCL) emerges as the most representative approach for graph representation learning, which leverages the principle of maximizing mutual information (Info…
Hierarchical Estimation for Effective and Efficient Sampling Graph Neural Network
Yang Li, Bingbing Xu, Qi Cao +2
Improving the scalability of GNNs is critical for large graphs. Existing methods leverage three sampling paradigms including node-wise, layer-wise and subgraph sampling, then desig…
DyTed: Disentangled Representation Learning for Discrete-time Dynamic Graph
Kaike Zhang, Qi Cao, Gaolin Fang +4
Unsupervised representation learning for dynamic graphs has attracted a lot of research attention in recent years. Compared with static graph, the dynamic graph is a comprehensive…
Adversarial Camouflage for Node Injection Attack on Graphs
Shuchang Tao, Qi Cao, Huawei Shen +4
Node injection attacks on Graph Neural Networks (GNNs) have received increasing attention recently, due to their ability to degrade GNN performance with high attack success rates.…
Augmentation-Aware Self-Supervision for Data-Efficient GAN Training
Liang Hou, Qi Cao, Yige Yuan +7
Training generative adversarial networks (GANs) with limited data is challenging because the discriminator is prone to overfitting. Previously proposed differentiable augmentation…
Twin Weisfeiler-Lehman: High Expressive GNNs for Graph Classification
Zhaohui Wang, Qi Cao, Huawei Shen +2
The expressive power of message passing GNNs is upper-bounded by Weisfeiler-Lehman (WL) test. To achieve high expressive GNNs beyond WL test, we propose a novel graph isomorphism t…