Disentangled Graph Prompting for Out-Of-Distribution Detection

• URL: http://arxiv.org/abs/2603.29644v1
• Date: Tue, 31 Mar 2026 12:05:28 GMT
• Title: Disentangled Graph Prompting for Out-Of-Distribution Detection
• Abstract summary: We propose Disentangled Graph Prompting (DGP) to identify out-of-distribution (OOD) samples at test time and alert the system.<n>DGP captures fine-grained ID patterns with the help of ID graph labels.<n>It achieves a relative AUC improvement of 3.63% over the best graph OOD detection baseline.
• Score: 23.671257912188125
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: When testing data and training data come from different distributions, deep neural networks (DNNs) will face significant safety risks in practical applications. Therefore, out-of-distribution (OOD) detection techniques, which can identify OOD samples at test time and alert the system, are urgently needed. Existing graph OOD detection methods usually characterize fine-grained in-distribution (ID) patterns from multiple perspectives, and train end-to-end graph neural networks (GNNs) for prediction. However, due to the unavailability of OOD data during training, the absence of explicit supervision signals could lead to sub-optimal performance of end-to-end encoders. To address this issue, we follow the pre-training+prompting paradigm to utilize pre-trained GNN encoders, and propose Disentangled Graph Prompting (DGP), to capture fine-grained ID patterns with the help of ID graph labels. Specifically, we design two prompt generators that respectively generate class-specific and class-agnostic prompt graphs by modifying the edge weights of an input graph. We also design several effective losses to train the prompt generators and prevent trivial solutions. We conduct extensive experiments on ten datasets to demonstrate the superiority of our proposed DGP, which achieves a relative AUC improvement of 3.63% over the best graph OOD detection baseline. Ablation studies and hyper-parameter experiments further show the effectiveness of DGP. Code is available at https://github.com/BUPT-GAMMA/DGP.

Related papers

• Learning to Explore: Policy-Guided Outlier Synthesis for Graph Out-of-Distribution Detection [51.93878677594561]
  In unsupervised graph-level OOD detection, models are typically trained using only in-distribution (ID) data.<n>We propose a Policy-Guided Outlier Synthesis framework that replaces statics with a learned exploration strategy.
  arXiv  Detail & Related papers  (2026-02-28T11:40:18Z)
• From Subtle to Significant: Prompt-Driven Self-Improving Optimization in Test-Time Graph OOD Detection [15.167705236111104]
  Graph Out-of-Distribution (OOD) detection aims to identify whether a test graph deviates from the distribution observed during training.<n>We propose a textbfSelf-textbfIm textbfGraph textbfOut-textbfof-textbfDistribution detector (SIGOOD)<n>SIGOOD generates a prompt to construct a prompt-enhanced graph that amplifies potential OOD signals.
  arXiv  Detail & Related papers  (2026-02-19T13:19:53Z)
• Exploiting Inter-Sample Information for Long-tailed Out-of-Distribution Detection [7.0229899259286945]
  We show that exploiting inter-sample relationships can significantly improve OOD detection in long-tailed recognition of vision datasets.<n>Our method outperforms the state-of-the-art approaches by a large margin in terms of FPR and tail-class ID classification accuracy.
  arXiv  Detail & Related papers  (2025-11-20T03:31:37Z)
• DFA-GNN: Forward Learning of Graph Neural Networks by Direct Feedback Alignment [57.62885438406724]
  Graph neural networks are recognized for their strong performance across various applications. BP has limitations that challenge its biological plausibility and affect the efficiency, scalability and parallelism of training neural networks for graph-based tasks. We propose DFA-GNN, a novel forward learning framework tailored for GNNs with a case study of semi-supervised learning.
  arXiv  Detail & Related papers  (2024-06-04T07:24:51Z)
• GOODAT: Towards Test-time Graph Out-of-Distribution Detection [103.40396427724667]
  Graph neural networks (GNNs) have found widespread application in modeling graph data across diverse domains. Recent studies have explored graph OOD detection, often focusing on training a specific model or modifying the data on top of a well-trained GNN. This paper introduces a data-centric, unsupervised, and plug-and-play solution that operates independently of training data and modifications of GNN architecture.
  arXiv  Detail & Related papers  (2024-01-10T08:37:39Z)
• Energy-based Out-of-Distribution Detection for Graph Neural Networks [76.0242218180483]
  We propose a simple, powerful and efficient OOD detection model for GNN-based learning on graphs, which we call GNNSafe. GNNSafe achieves up to $17.0%$ AUROC improvement over state-of-the-arts and it could serve as simple yet strong baselines in such an under-developed area.
  arXiv  Detail & Related papers  (2023-02-06T16:38:43Z)
• GOOD-D: On Unsupervised Graph Out-Of-Distribution Detection [67.90365841083951]
  We develop a new graph contrastive learning framework GOOD-D for detecting OOD graphs without using any ground-truth labels. GOOD-D is able to capture the latent ID patterns and accurately detect OOD graphs based on the semantic inconsistency in different granularities. As a pioneering work in unsupervised graph-level OOD detection, we build a comprehensive benchmark to compare our proposed approach with different state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-11-08T12:41:58Z)
• An Empirical Study of Retrieval-enhanced Graph Neural Networks [48.99347386689936]
  Graph Neural Networks (GNNs) are effective tools for graph representation learning. We propose a retrieval-enhanced scheme called GRAPHRETRIEVAL, which is agnostic to the choice of graph neural network models. We conduct comprehensive experiments over 13 datasets, and we observe that GRAPHRETRIEVAL is able to reach substantial improvements over existing GNNs.
  arXiv  Detail & Related papers  (2022-06-01T09:59:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.