FAITH: Few-Shot Graph Classification with Hierarchical Task Graphs
Song Wang, Yushun Dong, Xiao Huang, Chen Chen, Jundong Li

TL;DR
FAITH introduces a hierarchical task graph approach for few-shot graph classification, effectively capturing task correlations to improve classification accuracy with limited labeled data.
Contribution
The paper proposes a novel hierarchical task graph framework and a loss-based sampling strategy to leverage task correlations in few-shot graph classification.
Findings
Outperforms state-of-the-art methods on four datasets.
Effectively captures task correlations for better generalization.
Demonstrates robustness with limited labeled graphs.
Abstract
Few-shot graph classification aims at predicting classes for graphs, given limited labeled graphs for each class. To tackle the bottleneck of label scarcity, recent works propose to incorporate few-shot learning frameworks for fast adaptations to graph classes with limited labeled graphs. Specifically, these works propose to accumulate meta-knowledge across diverse meta-training tasks, and then generalize such meta-knowledge to the target task with a disjoint label set. However, existing methods generally ignore task correlations among meta-training tasks while treating them independently. Nevertheless, such task correlations can advance the model generalization to the target task for better classification performance. On the other hand, it remains non-trivial to utilize task correlations due to the complex components in a large number of meta-training tasks. To deal with this, we…
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
TopicsAdvanced Graph Neural Networks
