Hierarchical Cluster-based Open-World Graph Active Learning
Yayong Li, Zhengyi Du, Hong Zhang, Jonathan Wilton, Jinran Wu, Zongli Liu, Nan Ye
Abstract
Existing works in graph active learning (GAL) mostly assume a closed-world setting where all classes are known in advance, while in practice, we need to deal with the open-world setting where novel classes are encountered during learning. Apart from selecting informative nodes for refining the current classifier, the open-world GAL algorithms are also expected to discover novel classes. Motivated by the observation that identifying an informative region can be easier than finding the most informative example, we propose a novel hierarchical cluster-based algorithm for open-world GAL. Our algorithm performs clustering in the feature space to identify an informative region which either contains informative examples for known classes or novel classes, then performs a novel semi-supervised sub-clustering on the selected cluster to identify the most informative example. To facilitate the discovery of informative regions, we introduce a cluster-based self-distillation loss between ego and final embeddings to learn well-clustered node embeddings that are more likely to align with the classes. We also introduce a novel cluster informativeness score for the clusters, which measures not only how uncertain the cluster is (similar to standard active learning algorithms), but whether the cluster is likely to contain novel classes. Our semi-supervised sub-clustering algorithm partitions the selected cluster into subregions for known classes and an additional uncertain subregion, then we query the label for a representative node for the uncertain subregion. Extensive experiments on five benchmark datasets demonstrate the effectiveness of the proposed method with a more balanced improvement over novel classes. Ablation study shows that our cluster-based self-distillation loss, informativeness score, and the semi-supervised sub-clustering strategy are all beneficial. Empirical analysis also reveals how our informativeness score is effective for novel class discovery and identifying informative examples for refining the decision boundary.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 93eb40e0-03a7-475b-b844-d2fdb15f83b2Related papers
- GALAXY: Graph-based Active Learning at the ExtremeJifan Zhang, Julian Katz-Samuels, Robert D. NowakICML 2022 · 47 citations
- Active Generalized Category DiscoveryShijie Ma, Fei Zhu, Zhun Zhong, Xu-Yao Zhang et al.CVPR 2024 · 13 citations
- Inconsistency-Based Data-Centric Active Open-Set AnnotationRuiyu Mao, Ouyang Xu, Yunhui GuoAAAI 2024 · 7 citations
- A Graph-Theoretic Framework for Understanding Open-World Semi-Supervised LearningYiyou Sun, Zhenmei Shi, Yixuan LiNeurIPS 2023 · 38 citations
- Actively Supervised Clustering for Open Relation ExtractionJun Zhao, Yongxin Zhang, Qi Zhang, Tao Gui et al.ACL 2023 · 2 citations
