Pith. sign in

REVIEW

Towards OOD Detection in Graph Classification from Uncertainty Estimation Perspective

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 2206.10691 v1 pith:COEUGQAJ submitted 2022-06-21 cs.LG

classification cs.LG
keywords detectiongraphclassificationconsiderestimationperspectiveproblemuncertainty
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The problem of out-of-distribution detection for graph classification is far from being solved. The existing models tend to be overconfident about OOD examples or completely ignore the detection task. In this work, we consider this problem from the uncertainty estimation perspective and perform the comparison of several recently proposed methods. In our experiment, we find that there is no universal approach for OOD detection, and it is important to consider both graph representations and predictive categorical distribution.

Discussion (0). Continue with ORCID to comment.

Pith tools