Pith. sign in

REVIEW 3 cited by

DrugOOD: Out-of-Distribution (OOD) Dataset Curator and Benchmark for AI-aided Drug Discovery -- A Focus on Affinity Prediction Problems with Noise Annotations

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 2201.09637 v1 pith:HR57KF3H submitted 2022-01-24 cs.LG cs.AIq-bio.QM

classification cs.LGcs.AIq-bio.QM
keywords drugaidddrugoodnoiseai-aidedannotationscuratordataset
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

AI-aided drug discovery (AIDD) is gaining increasing popularity due to its promise of making the search for new pharmaceuticals quicker, cheaper and more efficient. In spite of its extensive use in many fields, such as ADMET prediction, virtual screening, protein folding and generative chemistry, little has been explored in terms of the out-of-distribution (OOD) learning problem with \emph{noise}, which is inevitable in real world AIDD applications. In this work, we present DrugOOD, a systematic OOD dataset curator and benchmark for AI-aided drug discovery, which comes with an open-source Python package that fully automates the data curation and OOD benchmarking processes. We focus on one of the most crucial problems in AIDD: drug target binding affinity prediction, which involves both macromolecule (protein target) and small-molecule (drug compound). In contrast to only providing fixed datasets, DrugOOD offers automated dataset curator with user-friendly customization scripts, rich domain annotations aligned with biochemistry knowledge, realistic noise annotations and rigorous benchmarking of state-of-the-art OOD algorithms. Since the molecular data is often modeled as irregular graphs using graph neural network (GNN) backbones, DrugOOD also serves as a valuable testbed for \emph{graph OOD learning} problems. Extensive empirical studies have shown a significant performance gap between in-distribution and out-of-distribution experiments, which highlights the need to develop better schemes that can allow for OOD generalization under noise for AIDD.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Subgraph Generation for Generalizing on Out-of-Distribution Links

    cs.LG 2025-07 conditional novelty 6.0 of 10

    FLEX is a generative framework that synthesizes counterfactual subgraphs with a semi-implicit graph VAE and adversarially co-trains a GNN to improve out-of-distribution link prediction.

  2. Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization

    cs.LG 2025-06 conditional novelty 6.0 of 10

    PrunE prunes spurious edges with a size constraint and an epsilon-probability alignment, reporting state-of-the-art graph OOD results despite a weak theoretical analysis.

  3. Learning Causality for Modern Machine Learning

    cs.LG 2025-06 conditional novelty 2.0 of 10

    A thesis compiling six papers that use causal invariance to improve graph neural networks' out-of-distribution generalization, interpretability, and robustness.

Pith tools