arXiv Machine Learning

APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries

arXiv:2510. 24380v2 Announce Type: replace Abstract: Make-on-demand combinatorial synthesis libraries (CSLs) like Enamine REAL have significantly enabled drug discovery efforts.

arXiv Machine Learning
Jun 26

Target-Aware Bandit Allocation for Scalable Surrogate Optimization in Chemical Space

arXiv:2606. 26657v1 Announce Type: new Abstract: Identifying high-utility candidates from massive discrete spaces under expensive evaluations is a recurring challenge across the sciences, with structure-based drug discovery as a prominent example.

By Mohammad Haddadnia, Yuvan Chali, Abhilash Jayaraj, Constance Kraay, Joana Reis, Felix Strieth-Kalthoff, Haribabu Arthanari
arXiv AI
Sep 25

TopU-LBVS: A Realistic Multi Target Benchmark for Ligand Based Virtual Screening

TopU-LBVS is a new multi‑target benchmark for ligand‑based virtual screening that addresses shortcomings of existing datasets by using hard‑negative decoys and a fixed 1:40 active‑to‑decoy ratio. It covers 93 protein targets across seven classes, provides three evaluation protocols (full, low‑data, and mini), and includes curated ChEMBL‑35 bioactivity data with property‑matched, structurally similar decoys. The benchmark demonstrates that performance drops sharply when moving from random‑decoy to hard‑negative evaluation, and it releases data, splits, code, and baseline implementations for reproducible comparison.

By Surbhi Kumar, Yuhe Zhou, Varun Shiralkar, Niu Huang, Baris Coskunuzer
Hugging Face Trending Papers
Sep 24

TopU-LBVS: A Realistic Multi Target Benchmark for Ligand Based Virtual Screening

TopU-LBVS is a new multi‑target benchmark for ligand‑based virtual screening that addresses shortcomings of previous datasets by using hard‑negative decoys and a fixed 1:40 active‑to‑decoy ratio. It covers 93 protein targets across seven classes, provides three evaluation protocols (full, low‑data, and mini), and includes curated ChEMBL‑35 bioactivity data with property‑matched, structurally similar decoys to reduce shortcut learning. The benchmark comes with released data, fixed splits, evaluation code, and baseline implementations for reproducible comparison of LBVS and molecular representation methods.

arXiv Machine Learning
Jun 16

Generative Molecular Design with Steerable and Granular Synthesizability Control

arXiv:2505. 08774v2 Announce Type: replace-cross Abstract: Designing molecules that are both property-optimal and readily synthesizable is a central challenge in drug discovery.

By Jeff Guo, V\'ictor Sabanza-Gil, Olha Semenenko, Oleksii Hrabovskyi, Mykola Protopopov, Anna Kapeliukha, Oleksandr Mosia, Sofiia Hatych, Diana Alieksieieva, Tom Nelis, Patrick Molliet, Helena Sol\'e-\`Avila, Valentas Olikauskas, Nina Aregger, Irina Morozova, Joseph Schmidt, Zlatko Jon\v{c}ev, Olga Tarkhanova, Petro Borysko, Jerome Waser, Bruno Correia, Jeremy Luterbacher, Philippe Schwaller
arXiv Machine Learning
Sep 25

OPDiv: Optimal Selection of Top-K High-Scoring, Diverse Compounds

OPDiv is a new algorithm that addresses the tradeoff between ranking quality and chemical diversity in virtual screening. It uses integer optimization to select an optimal subset of top‑k compounds that meet a specified diversity threshold, evaluated with fingerprint, shape, and electrostatic metrics. The method demonstrates how to benchmark virtual screening pipelines by comparing their best achievable diverse selections.

By Miroslav L\v{z}i\v{c}a\v{r} (Deep MedChem)
arXiv Statistics ML
Sep 7

Towards AI-Driven Nanomedicine Discovery: A Benchmark and Multimodal Learning Framework for Nano Self-Assembly Prediction

The paper introduces NSA-Bench, a public benchmark for predicting nano self‑assembly (NSA) between molecular pairs, framing it as a binary classification problem. It presents NSA‑Net, a multimodal learning framework that fuses graph topology, sequence semantics, and physicochemical descriptors to predict self‑assembly, achieving high ROC‑AUC scores and outperforming existing baselines. The study also demonstrates how NSA‑Net’s predictions can guide experimental formulation refinement through an NSA‑Agent case study.

By Quan Hao, Mengyue Fan, Zifan Dong, Jianduo Zhao, Changhao Xiao, Shangqing Jiao, Hao Zhang, Yudong Wang, Fei Xia, Jigang Wang, Liguo Zhang, Chong Qiu
arXiv Machine Learning
Jul 16

HEDGEHOG: Hierarchical Evaluation of Drug Generators Through Rigorous Filtration

arXiv:2607. 13155v1 Announce Type: new Abstract: Generative molecular models can support early drug discovery by proposing new candidate compounds de novo.

By Daria A. Ryabchenko (Ligand Pro, Moscow, Russia, Skolkovo Institute of Science and Technology, Artificial Intelligence Center, Moscow, Russia), Pavel Gurevich (Ligand Pro, Moscow, Russia, Skolkovo Institute of Science and Technology, Artificial Intelligence Center, Moscow, Russia), Shamil Kadyrov (Ligand Pro, Moscow, Russia), Daria Frolova (Ligand Pro, Moscow, Russia, Skolkovo Institute of Science and Technology, Artificial Intelligence Center, Moscow, Russia), Kseniia Fedisheva (Ligand Pro, Moscow, Russia), Sergei A. Nikolenko (Ligand Pro, Moscow, Russia), Alexander Shapeev (Ligand Pro, Moscow, Russia, Skolkovo Institute of Science and Technology, Artificial Intelligence Center, Moscow, Russia), Marina A. Pak (Ligand Pro, Moscow, Russia)
arXiv Machine Learning
1d ago

Scientific Discovery under Validation Congestion via Multi-Fidelity Pairwise Rankings

The paper introduces PRISMS, a framework that uses expert pairwise rankings of varying fidelity to curate scientific designs without relying on data-intensive regression models. By escalating queries from lower- to higher-fidelity rankers based on Fisher-information, PRISMS improves discovery recall and reduces the number of screening rounds compared to regression-only and non‑escalated ranking methods. In optimization tasks, PRISMS outperforms Bayesian optimization by achieving higher hypervolume.

By Kevin Tirta Wijaya, Alston Lo, Michael Sun, Wojciech Matusik, Vahid Babaei
arXiv AI
Aug 13

A Modular Agentic Framework for Synthetically Constrained Multi-Objective Hit-to-Lead Optimization

arXiv:2608. 11483v1 Announce Type: new Abstract: Hit-to-lead optimization requires iterative design of hit analogs across competing potency, selectivity, physicochemical, pharmacokinetic, safety, and synthetic constraints.

By Kelvin P. Idanwekhai, Enes Kelestemur, Benjamin Strickland, Matthew Hart, Steini Davidsson, Angelos Angelopoulos, Ron Alterovitz, Marcello DeLuca, Alexander Tropsha