When LLMs meet open-world graph learning: a new perspective for unlabeled data uncertainty
Not on the map. Why?
Abstract (arXiv)
Recently, large language models (LLMs) have significantly advanced text-attributed graph (TAG) learning. However, existing methods inadequately handle data uncertainty in open-world scenarios, especially concerning limited labeling and unknown-class nodes. Prior solutions typically rely on isolated semantic or structural approaches for unknown-class rejection, lacking effective annotation pipelines. To address these limitations, we propose Open-world Graph Assistant (OGA), an LLM-based framework that combines adaptive label traceability, which integrates semantics and topology for unknown-class rejection, and a graph label annotator to enable model updates using newly annotated nodes. Comprehensive experiments demonstrate OGA's effectiveness and practicality.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 37 of its 48 references that are in the map. First posted on arXiv 20 May 2025.
Builds on
37 of 48 references.
References · 37
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2020Uncertainty Aware Semi-Supervised Learning on Graph Datacited by 95
- 2021Graph Posterior Network: Bayesian Predictive Uncertainty for Node Classificationcited by 80
- 2023Label-free Node Classification on Graphs with Large Language Models (LLMS)cited by 72
- 2023Energy-based Out-of-Distribution Detection for Graph Neural Networkscited by 68
- 2020Streaming Graph Neural Networks via Continual Learningcited by 64
- 2023Augmenting Low-Resource Text Classification with Graph-Grounded Pre-training and Promptingcited by 62
- 2025SAMGPT: Text-free Graph Foundation Model for Multi-domain Pre-training and Cross-domain Adaptationcited by 62
- 2024GOFA: A Generative One-For-All Model for Joint Graph Language Modelingcited by 57
25 more
- 2024ARC: A Generalist Graph Anomaly Detector with In-Context Learningcited by 48
- 2022GOOD-D: On Unsupervised Graph Out-Of-Distribution Detectioncited by 47
- 2021Continual Learning of Knowledge Graph Embeddingscited by 35
- 2023Learning on Graphs with Out-of-Distribution Nodescited by 29
- 2021Hierarchical Prototype Networks for Continual Graph Representation Learningcited by 28
- 2020Disentangle-based Continual Graph Representation Learningcited by 25
- 2020Graph-Based Continual Learningcited by 24
- 2022Reinforced Continual Learning for Graphscited by 24
- 2020Lifelong Learning of Graph Neural Networks for Open-World Node Classificationcited by 22
- 2019Entropic Out-of-Distribution Detectioncited by 21
- 2021Motif Prediction with Graph Neural Networkscited by 18
- 2023Open-world Semi-supervised Novel Class Discoverycited by 15
- 2025GOLD: Graph Out-of-Distribution Detection via Implicit Adversarial Latent Generationcited by 15
- 2024DSLR: Diversity Enhancement and Structure Learning for Rehearsal-based Graph Continual Learningcited by 14
- 2024LEGO-Learn: Label-Efficient Graph Open-Set Learningcited by 10
- 2023Universal Graph Continual Learningcited by 9
- 2024Graph Continual Learning with Debiased Lossless Memory Replaycited by 9
- 2025Decoupled Graph Energy-based Model for Node Out-of-Distribution Detection on Heterophilic Graphscited by 9
- 2024Contrastive Augmented Graph2Graph Memory Interaction for Few Shot Continual Learningcited by 7
- 2025Bounded and Uniform Energy-based Out-of-distribution Detection for Graphscited by 6
- 2025Graph Synthetic Out-of-Distribution Exposure with Large Language Modelscited by 6
- 2023Open-World Lifelong Graph Learningcited by 5
- 2024FTF-ER: Feature-Topology Fusion-Based Experience Replay Method for Continual Graph Learningcited by 3
- 2024Beyond the Known: Novel Class Discovery for Open-world Graph Learningcited by 2
- 2024Open-World Semi-Supervised Learning for Node Classificationcited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.