mlsanityData to 14 Oct 2026

Removing Biases from Molecular Representations via Information Maximization

arXiv 2312.00718 ↗First posted 1 Dec 2023cs.LG cs.AI q-bio.BMcited by 6

Not on the map. Why?

Abstract (arXiv)

High-throughput drug screening -- using cell imaging or gene expression measurements as readouts of drug effect -- is a critical tool in biotechnology to assess and understand the relationship between the chemical structure and biological activity of a drug. Since large-scale screens have to be divided into multiple experiments, a key difficulty is dealing with batch effects, which can introduce systematic errors and non-biological associations in the data. We propose InfoCORE, an Information maximization approach for COnfounder REmoval, to effectively deal with batch effects and obtain refined molecular representations. InfoCORE establishes a variational lower bound on the conditional mutual information of the latent representations given a batch identifier. It adaptively reweighs samples to equalize their implied batch distribution. Extensive experiments on drug screening data reveal InfoCORE's superior performance in a multitude of tasks including molecular property prediction and molecule-phenotype retrieval. Additionally, we show results for how InfoCORE offers a versatile framework and resolves general distribution shifts and issues of data fairness by minimizing correlation with spurious features or removing sensitive attributes. The code is available at https://github.com/uhlerlab/InfoCORE.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 27 of its 58 references that are in the map. First posted on arXiv 1 Dec 2023.

Builds on

27 of 58 references.

References · 27

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  3. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  4. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
  5. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  6. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  7. 2016Equality of Opportunity in Supervised Learningcited by 2,007
  8. 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
  9. 2019Contrastive Multiview Codingcited by 1,301
  10. 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,051
  11. 2019Learning Representations by Maximizing Mutual Information Across Viewscited by 734
  12. 2014Certifying and removing disparate impactcited by 715
15 more
  1. 2019On Variational Bounds of Mutual Informationcited by 559
  2. 2020Fairness without Demographics through Adversarially Reweighted Learningcited by 251
  3. 2022Discovering Invariant Rationales for Graph Neural Networkscited by 188
  4. 2022Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanismcited by 171
  5. 20213D Infomax improves GNNs for Molecular Property Predictioncited by 146
  6. 2019Inherent Tradeoffs in Learning Fair Representationscited by 144
  7. 2022Learning Causally Invariant Representations for Out-of-Distribution Generalization on Graphscited by 144
  8. 2021Self-supervised Graph-level Representation Learning with Local and Global Structurecited by 125
  9. 2021Open Domain Generalization with Domain-Augmented Meta-Learningcited by 115
  10. 2021Can contrastive learning avoid shortcut solutions?cited by 114
  11. 2018Learning Controllable Fair Representationscited by 83
  12. 2022Debiasing Graph Neural Networks via Learning Disentangled Causal Substructurecited by 83
  13. 2021Conditional Contrastive Learning for Improving Fairness in Self-Supervised Learningcited by 25
  14. 2022Conditional Contrastive Learning with Kernelcited by 22
  15. 2023Molecule-Morphology Contrastive Pretraining for Transferable Molecular Representationcited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 3; 2025: 1; 2026: 2.

6 papers.