Pith. sign in

REVIEW 2 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.22097 v1 pith:7JXJ6QRS submitted 2025-03-28 cs.LG cs.CL

classification cs.LGcs.CL
keywords nodesdetectiongraphllmsannotationfilterhumanstructural
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Graph Synthetic Out-of-Distribution Exposure with Large Language Models

    cs.LG 2025-04 conditional novelty 6.0 of 10

    LLM-identified or LLM-generated pseudo-OOD nodes used as exposure data during GNN training improve node-level OOD detection on text-attributed graphs without real OOD labels.

  2. GLIP-OOD: Zero-Shot Graph OOD Detection with Graph Foundation Model

    cs.LG 2025-04 conditional novelty 6.0 of 10

    GLIP-OOD performs zero-shot node-level OOD detection on text-attributed graphs using a graph foundation model, optionally with LLM-generated pseudo-OOD labels, and matches or exceeds supervised baselines.

Pith tools