.png){kind=icon}
返回
Iterative Graph Self-Distillation
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2023.3303885.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently, there has been increasing interest in the challenge of how to discriminatively vectorize graphs. To address this, we propose a method called Iterative Graph Self-Distillation (IGSD) which learns graph-level representation in an unsupervised manner through instance discrimination using a self-supervised contrastive learning approach. IGSD involves a teacher-student distillation process that uses graph diffusion augmentations and constructs the teacher model using an exponential moving average of the student model. The intuition behind IGSD is to predict the teacher network representation of the graph pairs under different augmented views. As a natural extension, we also apply IGSD to semi-supervised scenarios by jointly regularizing the network with both supervised and self-supervised contrastive loss. Finally, we show that fine-tuning the IGSD-trained models with self-training can further improve graph representation learning. Empirically, we achieve significant and consistent performance gain on various graph datasets in both unsupervised and semi-supervised settings, which well validates the superiority of IGSD.
Keyword:
Task analysis
Representation learning
Kernel
Graph neural networks
Iterative methods
Data augmentation
Training
graph representation learning
self-supervised learning
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
Artificial intelligence in COVID-19 drug repurposing人工智能在新型冠状病毒肺炎药物再利用中的应用.png)
LANCET DIGITAL HEALTH
OAAI
LANCET DIGITAL HEALTHIF24.1
OAAI分享收藏
查看更多内容