Task-Equivariant Graph Few-shot Learning
Sungwon Kim, Junseok Lee, Namkyeong Lee, Wonjoong Kim, Seungyoon Choi, Chanyoung Park
摘要
Although Graph Neural Networks (GNNs) have been successful in node classification tasks, their performance heavily relies on the availability of a sufficient number of labeled nodes per class. In real-world situations, not all classes have many labeled nodes and there may be instances where the model needs to classify new classes, making manual labeling difficult. To solve this problem, it is important for GNNs to be able to classify nodes with a limited number of labeled nodes, known as few-shot node classification. Previous episodic meta-learning based methods have demonstrated success in few-shot node classification, but our findings suggest that optimal performance can only be achieved with a substantial amount of diverse training meta-tasks. To address this challenge of meta-learning based few-shot learning (FSL), we propose a new approach, the Task-Equivariant Graph few-shot learning (TEG) framework. Our TEG framework enables the model to learn transferable task-adaptation strategies using a limited number of training meta-tasks, allowing it to acquire meta-knowledge for a wide range of meta-tasks. By incorporating equivariant neural networks, TEG can utilize their strong generalization abilities to learn highly adaptable task-specific strategies. As a result, TEG achieves state-of-the-art performance with limited training meta-tasks. Our experiments on various benchmark datasets demonstrate TEG's superiority in terms of accuracy and generalization ability, even when using minimal meta-training data, highlighting the effectiveness of our proposed approach in addressing the challenges of metalearning based few-shot node classification. Our code is available at the following link: https://github.com/sung-won-kim/TEG CCS CONCEPTS • Computing methodologies → Artificial intelligence; Supervised learning by classification.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper6
- Dual-level Mixup for Graph Few-shot Learning with Fewer TasksYonghao Liu, Mengyu Li, Fausto Giunchiglia, Lan Huang 等WWW 2025 · 被引用 8 次
- Graph Few-Shot Learning via Adaptive Spectrum Experts and Cross-Set Distribution CalibrationYonghao Liu, Yajun Wang, Chunli Guo, Wei Pang 等NeurIPS 2025 · 被引用 6 次
- Unsupervised Episode Generation for Graph Meta-learningJihyeong Jung, Sangwoo Seo, Sungwon Kim, Chanyoung ParkICML 2024 · 被引用 4 次
- Advancing Graph Few-Shot Learning via In-Context LearningRenchu Guan, Yajun Wang, Chunli Guo, Bowen Cao 等KDD 2026 · 被引用 1 次
- Enhancing Unsupervised Graph Few-shot Learning via Set Functions and Optimal TransportYonghao Liu, Fausto Giunchiglia, Ximing Li, Lan Huang 等KDD 2025
它引用的顶会 Paper13
- E(n) Equivariant Graph Neural NetworksVictor Garcia Satorras, Emiel Hoogeboom, Max WellingICML 2021 · 被引用 1,432 次
- Meta-Baseline: Exploring Simple Meta-Learning for Few-Shot LearningYinbo Chen, Zhuang Liu, Huijuan Xu, Trevor Darrell 等ICCV 2021 · 被引用 455 次
- Equivariant Flows: Exact Likelihood Generative Learning for Symmetric DensitiesJonas Köhler, Leon Klein, Frank NoéICML 2020 · 被引用 330 次
- Augmentation-Free Self-Supervised Learning on GraphsNamkyeong Lee, Junseok Lee, Chanyoung ParkAAAI 2022 · 被引用 288 次
- Graph Meta Learning via Local SubgraphsKexin Huang, Marinka ZitnikNeurIPS 2020 · 被引用 205 次
相关 Paper
- Task-Adaptive Few-shot Node ClassificationSong Wang, Kaize Ding, Chuxu Zhang, Chen Chen 等KDD 2022 · 被引用 40 次
- Graph Few-shot Learning with Task-specific StructuresSong Wang, Chen Chen, Jundong LiNeurIPS 2022 · 被引用 38 次
- Task Negative Sampling Enhanced Graph Few-shot LearningChenxu Wang, Jinfeng Chen, Junzhou Zhao, Pinghui WangKDD 2025
- Contrastive Meta-Learning for Few-shot Node ClassificationSong Wang, Zhen Tan, Huan Liu, Jundong LiKDD 2023 · 被引用 20 次
- Graph Few-Shot Learning via Knowledge TransferHuaxiu Yao, Chuxu Zhang, Ying Wei, Meng Jiang 等AAAI 2020 · 被引用 193 次
