Information-Dense Synthesis for Molecular Discovery
stat.ML, cs.LG, physics.chem-ph, q-bio.BM
Submitted: 2026-10-06
Updated: 2026-10-06
Project page: https://betanalpha.github.io/assets/case_studies/modeling_sparsity.html
License: http://creativecommons.org/licenses/by/4.0/
The gist: Machine learning can accelerate molecular discovery by designing molecules and planning experiments.
Abstract
Machine learning can accelerate molecular discovery by designing molecules and planning experiments. However, many scientific challenges demand molecules with very rare properties, and in this sparse setting, existing algorithms offer little gain over random guessing. We propose a method to efficiently search large regions of molecular space using algorithmically controlled stochastic synthesis. Rather than design, make and test individual molecules, we design and make complex mixtures, test them as a pool, then deconvolute the molecule-activity map. We optimize synthesis to encode maximal information. Theoretically, this approach can reduce the number of experiments required to find the optimal molecule among d candidates from O(d) to O(d) or O(1). In simulation, on estimated protein fitness landscapes, it finds active molecules with an order of magnitude fewer experiments than existing Bayesian optimization methods.
Sources
- Group Testing: An Information Theory Perspective
- Biological Sequence Kernels with Guaranteed Flexibility
- Deep Adaptive Design: Amortizing Sequential Bayesian Experimental Design
- AtomComposer: Discovering Chemical Space from First Principles with Reinforcement Learning
- Flexible Kernels for Protein Property Prediction
- Purely Agent-Driven Black-Box Optimization for Biological Design
- Combined Global and Local Search for Optimization with Gaussian Process Models
- Composable Effects for Flexible and Accelerated Probabilistic Programming in NumPyro
- Wasserstein Gradient Flows for Batch Bayesian Optimal Experimental Design
- Estimating the Causal Effects of T Cell Receptors
- Automated Variational Inference in Probabilistic Programming
- Deep Sets
Related papers
- Behavior of prediction performance metrics with rare events
- Optimal Estimation of Generic Dynamics by Path-Dependent Neural Jump ODEs
- A Posterior-Dynamics Framework for Imaging Inverse Problems with Pretrained Diffusion Priors
- Efficient quadratic entropy with distance sketches
- Embedding-Bias in Conditional Independence Testing
- From Log-Odds to Shapley Values: An Explanatory Geometry for the Weighted Naive Bayes Classifier