Lo-Hi: Practical ML Drug Discovery Benchmark

Simon Steshin
2/12/2026

No official code found. Best implementation: SteshinSS/lohi_neurips2023 (12 stars, MIT, last commit 2023-11-13).

Abstract

Finding new drugs is getting harder and harder. One of the hopes of drug discovery is to use machine learning models to predict molecular properties. That is why models for molecular property prediction are being developed and tested on benchmarks such as MoleculeNet. However, existing benchmarks are unrealistic and are too different from applying the models in practice. We have created a new practical \emph{Lo-Hi} benchmark consisting of two tasks: Lead Optimization (Lo) and Hit Identification (Hi), corresponding to the real drug discovery process. For the Hi task, we designed a novel molecular splitting algorithm that solves the Balanced Vertex Minimum $k$-Cut problem. We tested state-of-the-art and classic ML models, revealing which works better under practical settings. We analyzed modern benchmarks and showed that they are unrealistic and overoptimistic. Review: https://openreview.net/forum?id=H2Yb28qGLV Lo-Hi benchmark: https://github.com/SteshinSS/lohi_neurips2023 Lo-Hi splitter library: https://github.com/SteshinSS/lohi_splitter

View on arXivView PDF

Code Implementations(1)

MIT

Lo-Hi: Practical ML Drug Discovery Benchmark paper

121Python, Jupyter NotebookSep 24, 20232 years agoMIT

Similar Papers

Cite this paper

@article{steshin2026lohi,
  title  = {Lo-Hi: Practical ML Drug Discovery Benchmark},
  author = {Simon Steshin},
  year   = {2026},
  eprint = {2310.06399},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/pdf/2310.06399},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.06399.svg)](https://codeofpaper.com/paper/2310.06399)

Discussion