The reviewed record of science sign in
Pith

arxiv: 2206.08452 · v2 · pith:NIOPU7AC · submitted 2022-06-16 · cs.LG · cs.AI

GOOD: A Graph Out-of-Distribution Benchmark

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:NIOPU7ACrecord.jsonopen to challenge →

classification cs.LG cs.AI
keywords goodbenchmarkdifferentshiftsgraphresultsconceptcovariate
0
0 comments X
read the original abstract

Out-of-distribution (OOD) learning deals with scenarios in which training and test data follow different distributions. Although general OOD problems have been intensively studied in machine learning, graph OOD is only an emerging area of research. Currently, there lacks a systematic benchmark tailored to graph OOD method evaluation. In this work, we aim at developing an OOD benchmark, known as GOOD, for graphs specifically. We explicitly make distinctions between covariate and concept shifts and design data splits that accurately reflect different shifts. We consider both graph and node prediction tasks as there are key differences in designing shifts. Overall, GOOD contains 11 datasets with 17 domain selections. When combined with covariate, concept, and no shifts, we obtain 51 different splits. We provide performance results on 10 commonly used baseline methods with 10 random runs. This results in 510 dataset-model combinations in total. Our results show significant performance gaps between in-distribution and OOD settings. Our results also shed light on different performance trends between covariate and concept shifts by different methods. Our GOOD benchmark is a growing project and expects to expand in both quantity and variety of resources as the area develops. The GOOD benchmark can be accessed via https://github.com/divelab/GOOD/.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Adversarial Label Invariant Graph Data Augmentations for Out-of-Distribution Generalization

    cs.LG 2026-04 unverdicted novelty 6.0

    RIA uses adversarial exploration of counterfactual graph environments via label-invariant augmentations to improve OoD generalization in graph classification tasks.

  2. Physics-Aware Auxiliary Losses Improve Out-of-Distribution Generalization of a GNN Synthesizability Filter

    cs.LG 2026-06 unverdicted novelty 4.0

    Adding Bertz index regression and MMFF94 strain penalty as auxiliary losses to a GINE GNN yields small but statistically significant OOD AUC improvements (up to +0.0066) on natural products when trained on drug-like m...