Robust Graph Meta-learning for Weakly-supervised Few-shot Node Classification
Graphs are widely used to model the relational structure of data, and the research of graph machine learning (ML) has a wide spectrum of applications ranging from drug design in molecular graphs to friendship recommendation in social networks. Prevailing approaches for graph ML typically require abundant labeled instances in achieving satisfactory results, which is commonly infeasible in real-world scenarios since labeled data for newly emerged concepts (e.g., new categorizations of nodes) on graphs is limited. Though meta-learning has been applied to different few-shot graph learning problems, most existing efforts predominately assume that all the data from those seen classes is gold-labeled, while those methods may lose their efficacy when the seen data is weakly-labeled with severe label noise. As such, we aim to investigate a novel problem of weakly-supervised graph meta-learning for improving the model robustness in terms of knowledge transfer. To achieve this goal, we propose a new graph meta-learning framework -- Graph Hallucination Networks (Meta-GHN) in this paper. Based on a new robustness-enhanced episodic training, Meta-GHN is meta-learned to hallucinate clean node representations from weakly-labeled data and extracts highly transferable meta-knowledge, which enables the model to quickly adapt to unseen tasks with few labeled instances. Extensive experiments demonstrate the superiority of Meta-GHN over existing graph meta-learning studies on the task of weakly-supervised few-shot node classification.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationDrug DesignGraph LearningHallucinationMeta-LearningNode ClassificationTransfer LearningSimilar Papers 제목 키워드 기반
MetaConcept: Learn to Abstract via Concept Graph for Weakly-Supervised Few-Shot Learning
Meta-learning has been proved to be an effective framework to address few-shot learning problems. The key challenge is how to minimize the generalization error of base learner across tasks. In this paper, we explore the …
Few-Shot LearningMeta-LearningTransductive Linear Probing: A Novel Framework for Few-Shot Node Classification
Few-shot node classification is tasked to provide accurate predictions for nodes from novel classes with only few representative labeled nodes. This problem has drawn tremendous attention for its projection to prevailing…
ClassificationContrastive LearningMeta-LearningNode Classification+2Supervised Graph Contrastive Learning for Few-shot Node Classification
Graphs are present in many real-world applications, such as financial fraud detection, commercial recommendation, and social network analysis. But given the high cost of graph annotation or labeling, we face a severe gra…
ClassificationContrastive LearningData AugmentationFew-Shot Learning+3Prototype Propagation Networks (PPN) for Weakly-supervised Few-shot Learning on Category Graph
A variety of machine learning applications expect to achieve rapid learning from a limited number of labeled data. However, the success of most current models is the result of heavy training on big data. Meta-learning ad…
Few-Shot LearningGeneral ClassificationMeta-LearningMeta-Learners for Few-Shot Weakly-Supervised Medical Image Segmentation
Most uses of Meta-Learning in visual recognition are very often applied to image classification, with a relative lack of works in other tasks {such} as segmentation and detection. We propose a generic Meta-Learning frame…
image-classificationImage ClassificationImage SegmentationMedical Image Segmentation+5