TL;DR
Meta-GPS++ is a novel graph meta-learning framework that improves few-shot node classification by combining contrastive learning, self-training, and task-specific adaptations, effectively handling heterophilic and homophilic graphs.
Contribution
It introduces a comprehensive approach integrating contrastive learning, self-training, and task-specific transformations to enhance few-shot node classification on diverse graph types.
Findings
Outperforms existing methods on real-world datasets
Effectively handles heterophilic and homophilic graphs
Utilizes unlabeled nodes to improve learning
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsContrastive Learning
