ImDrug: A Benchmark for Deep Imbalanced Learning in AI-aided Drug Discovery
Not on the map. Why?
Abstract (arXiv)
The last decade has witnessed a prosperous development of computational methods and dataset curation for AI-aided drug discovery (AIDD). However, real-world pharmaceutical datasets often exhibit highly imbalanced distribution, which is overlooked by the current literature but may severely compromise the fairness and generalization of machine learning applications. Motivated by this observation, we introduce ImDrug, a comprehensive benchmark with an open-source Python library which consists of 4 imbalance settings, 11 AI-ready datasets, 54 learning tasks and 16 baseline algorithms tailored for imbalanced learning. It provides an accessible and customizable testbed for problems and solutions spanning a broad spectrum of the drug discovery pipeline such as molecular modeling, drug-target interaction and retrosynthesis. We conduct extensive empirical studies with novel evaluation metrics, to demonstrate that the existing algorithms fall short of solving medicinal and pharmaceutical challenges in the data imbalance scenario. We believe that ImDrug opens up avenues for future research and development, on real-world challenges at the intersection of AIDD and deep imbalanced learning.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 30 of its 88 references that are in the map. First posted on arXiv 16 Sep 2022.
Builds on
30 of 88 references.
References · 30
- 2017Attention Is All You Needcited by 59,932
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2019Class-Balanced Loss Based on Effective Number of Samplescited by 1,239
- 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,037
- 2019Decoupling Representation and Classifier for Long-Tailed Recognitioncited by 806
- 2019Large-Scale Long-Tailed Recognition in an Open Worldcited by 704
- 2021Deep Long-Tailed Learning: A Surveycited by 416
- 2019BBN: Bilateral-Branch Network with Cumulative Learning for Long-Tailed Visual Recognitioncited by 403
- 2020Balanced Meta-Softmax for Long-Tailed Visual Recognitioncited by 397
- 2018GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoderscited by 375
- 2021Therapeutics Data Commons: Machine Learning Datasets and Tasks for Drug Discovery and Developmentcited by 258
18 more
- 2021Trustworthy AI: From Principles to Practicescited by 206
- 2021Distribution Alignment: A Unified Framework for Long-tail Visual Recognitioncited by 198
- 2017Learning to Plan Chemical Synthesescited by 175
- 2017Deep Reinforcement Learning for De-Novo Drug Designcited by 161
- 2021Delving into Deep Imbalanced Regressioncited by 157
- 2022G-Mixup: Graph Data Augmentation for Graph Classificationcited by 145
- 2020Remix: Rebalanced Mixupcited by 144
- 2020Rethinking Class-Balanced Methods for Long-Tailed Visual Recognition from a Domain Adaptation Perspectivecited by 143
- 2021Influence-Balanced Loss for Imbalanced Visual Classificationcited by 91
- 2018Deep Imbalanced Learning for Face Recognition and Attribute Predictioncited by 90
- 2017Retrosynthetic reaction prediction using neural sequence-to-sequence modelscited by 82
- 2020Identifying and Compensating for Feature Deviation in Imbalanced Deep Learningcited by 76
- 2021Distilling Virtual Examples for Long-tailed Recognitioncited by 72
- 2020Mapping the Space of Chemical Reactions Using Attention-Based Neural Networkscited by 70
- 2022DrugOOD: Out-of-Distribution (OOD) Dataset Curator and Benchmark for AI-aided Drug Discovery -- A Focus on Affinity Prediction Problems with Noise Annotationscited by 54
- 2018DeepAffinity: Interpretable Deep Learning of Compound-Protein Affinity through Unified Recurrent and Convolutional Neural Networkscited by 52
- 2022ImGCL: Revisiting Graph Contrastive Learning on Imbalanced Node Classificationcited by 21
- 2019Master your Metrics with Calibrationcited by 8
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 1.
3 papers.