mlsanityData to 7 Oct 2026

Few-Shot Graph Out-of-Distribution Detection with LLMs

arXiv 2503.22097 ↗First posted 28 Mar 2025cs.LG cs.CLcited by 6

Not on the map. Why?

Abstract (arXiv)

Existing methods for graph out-of-distribution (OOD) detection typically depend on training graph neural network (GNN) classifiers using a substantial amount of labeled in-distribution (ID) data. However, acquiring high-quality labeled nodes in text-attributed graphs (TAGs) is challenging and costly due to their complex textual and structural characteristics. Large language models (LLMs), known for their powerful zero-shot capabilities in textual tasks, show promise but struggle to naturally capture the critical structural information inherent to TAGs, limiting their direct effectiveness. To address these challenges, we propose LLM-GOOD, a general framework that effectively combines the strengths of LLMs and GNNs to enhance data efficiency in graph OOD detection. Specifically, we first leverage LLMs' strong zero-shot capabilities to filter out likely OOD nodes, significantly reducing the human annotation burden. To minimize the usage and cost of the LLM, we employ it only to annotate a small subset of unlabeled nodes. We then train a lightweight GNN filter using these noisy labels, enabling efficient predictions of ID status for all other unlabeled nodes by leveraging both textual and structural information. After obtaining node embeddings from the GNN filter, we can apply informativeness-based methods to select the most valuable nodes for precise human annotation. Finally, we train the target ID classifier using these accurately annotated ID nodes. Extensive experiments on four real-world TAG datasets demonstrate that LLM-GOOD significantly reduces human annotation costs and outperforms state-of-the-art baselines in terms of both ID classification accuracy and OOD detection performance.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 24 of its 31 references that are in the map. First posted on arXiv 28 Mar 2025.

Builds on

24 of 31 references.

References · 24

  1. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  2. 2016A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networkscited by 2,362
  3. 2018A Simple Unified Framework for Detecting Out-of-Distribution Samples and Adversarial Attackscited by 1,472
  4. 2017Enhancing The Reliability of Out-of-distribution Image Detection in Neural Networkscited by 1,325
  5. 2020Energy-based Out-of-distribution Detectioncited by 1,296
  6. 2022OpenOOD: Benchmarking Generalized Out-of-Distribution Detectioncited by 267
  7. 2020Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networkscited by 253
  8. 2023CLIPN for Zero-Shot OOD Detection: Teaching CLIP to Say Nocited by 130
  9. 2023LoCoOp: Few-Shot Out-of-Distribution Detection via Prompt Learningcited by 107
  10. 2020Graph Prototypical Networks for Few-shot Learning on Attributed Networkscited by 90
  11. 2023Label-free Node Classification on Graphs with Large Language Models (LLMS)cited by 72
  12. 2024A Survey of Large Language Models for Graphscited by 71
12 more
  1. 2023Energy-based Out-of-Distribution Detection for Graph Neural Networkscited by 67
  2. 2017Active Learning for Graph Embeddingcited by 53
  3. 2023ID-like Prompt Learning for Few-Shot Out-of-Distribution Detectioncited by 42
  4. 2021Graph Few-shot Class-incremental Learningcited by 40
  5. 2019Active Learning for Graph Neural Networks via Node Feature Propagationcited by 37
  6. 2024GraphEdit: Large Language Models for Graph Structure Learningcited by 33
  7. 2023Learning on Graphs with Out-of-Distribution Nodescited by 29
  8. 2024A Survey of Data-Efficient Graph Learningcited by 18
  9. 2021Hybrid Graph Neural Networks for Few-Shot Learningcited by 15
  10. 2024LEGO-Learn: Label-Efficient Graph Open-Set Learningcited by 10
  11. 2024Multitask Active Learning for Graph Anomaly Detectioncited by 7
  12. 2024Zero-Shot Out-of-Distribution Detection with Outlier Label Exposurecited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 4; 2026: 2.

6 papers.