arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.14732cs.LGcs.SI
收藏

Meta-GPS++:利用对比学习和自训练增强图元学习

Meta-GPS++: Enhancing Graph Meta-Learning with Contrastive Learning and Self-Training

College of Computer Science and Technology, Jilin University(吉林大学计算机科学与技术学院);University of Trento(特伦托大学);Zhuhai College of Science and Technology(珠海科技学院)

Yonghao Liu, Mengyu Li, Ximing Li, Lan Huang, Fausto Giunchiglia, Yanchun Liang, Xiaoyue Feng, Renchu Guan

AI总结:

针对少样本节点分类中同质/异质图适配、随机干扰、未标记数据利用不足及任务差异化缺失等问题,提出Meta-GPS++框架,结合原型初始化、对比学习、自训练及S²变换,在真实数据集上取得优越性能。

摘要:

节点分类是图学习中的一个基本问题。然而,许多模型在应用于少样本场景时通常表现不佳。一些研究尝试将元学习与图神经网络相结合,以解决图上的少样本节点分类问题。尽管这些方法取得了令人鼓舞的性能,但仍存在一些局限性。首先,它们采用同质图的节点编码机制来学习节点嵌入,即使在异质图中也是如此。其次,基于元学习的现有模型忽略了学习过程中随机性的干扰。第三,它们仅使用特定任务中有限的标记节点进行训练,没有显式利用大量未标记节点。最后,它们几乎平等地对待所有采样任务,没有针对其独特性进行定制。为了解决这些问题,我们提出了一种用于少样本节点分类的新框架,称为Meta-GPS++。具体来说,我们首先采用一种高效的方法在同质图和异质图上学习判别性节点表示。然后,我们利用基于原型的方法初始化参数,并利用对比学习来正则化节点嵌入的分布。此外,我们应用自训练从未标记节点中提取有价值的信息。另外,我们采用S$^2$(缩放与平移)变换来从不同任务中学习可迁移的知识。在真实世界数据集上的结果表明了Meta-GPS++的优越性。我们的代码可在此处获取。

英文摘要:

Node classification is an essential problem in graph learning. However, many models typically obtain unsatisfactory performance when applied to few-shot scenarios. Some studies have attempted to combine meta-learning with graph neural networks to solve few-shot node classification on graphs. Despite their promising performance, some limitations remain. First, they employ the node encoding mechanism of homophilic graphs to learn node embeddings, even in heterophilic graphs. Second, existing models based on meta-learning ignore the interference of randomness in the learning process. Third, they are trained using only limited labeled nodes within the specific task, without explicitly utilizing numerous unlabeled nodes. Finally, they treat almost all sampled tasks equally without customizing them for their uniqueness. To address these issues, we propose a novel framework for few-shot node classification called Meta-GPS++. Specifically, we first adopt an efficient method to learn discriminative node representations on homophilic and heterophilic graphs. Then, we leverage a prototype-based approach to initialize parameters and contrastive learning for regularizing the distribution of node embeddings. Moreover, we apply self-training to extract valuable information from unlabeled nodes. Additionally, we adopt S$^2$ (scaling & shifting) transformation to learn transferable knowledge from diverse tasks. The results on real-world datasets show the superiority of Meta-GPS++. Our code is available here.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑