TL;DR
This paper introduces Disentangled Graph Prompting (DGP), a novel method leveraging pre-trained GNN encoders and prompt generators to improve out-of-distribution detection in graph data.
Contribution
It proposes a new DGP framework that uses class-specific and class-agnostic prompts to enhance ID pattern capture without OOD training data.
Findings
DGP achieves a 3.63% relative AUC improvement over baselines.
Extensive experiments validate DGP's effectiveness across ten datasets.
Ablation studies confirm the importance of prompt design and training losses.
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.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
