Batched Bayesian Optimization by Maximizing the Probability of Including the Optimum

Batched Bayesian optimization (BO) can accelerate molecular design by efficiently identifying top-performing compounds from a large chemical library. Existing acquisition strategies for batch design in BO aim to balance exploration and exploitation. This often involves optimizing nonadditive batch acquisition functions, necessitating approximation via myopic construction and/or diversity heuristics. In this work, we propose an acquisition strategy for discrete optimization that is motivated by pure exploitation, qPO (multipoint Probability of Optimality). qPO maximizes the probability that the batch includes the true optimum, which is expressed as the sum over individual acquisition scores and thereby circumvents the combinatorial challenge of optimizing a batch acquisition function. We differentiate the proposed strategy from parallel Thompson sampling and discuss how it implicitly captures diversity. Finally, we apply our method to the model-guided exploration of large chemical libraries and provide empirical evidence that it is competitive with and complements other state-of-the-art methods in batched Bayesian optimization.

Authors

Institutions

Publication Details

Journal
Journal of Chemical Information and Modeling
Published
2025-05-05
DOI
https://doi.org/10.1021/acs.jcim.5c00214
Citations
5
Primary Topic
Machine Learning and Data Classification
Type
article
Field-Weighted Citation Impact
12.40

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Batched Bayesian Optimization by Maximizing the Probability of Including the Optimum

Austin Tripp, Runzhong Wang, Connor W. Coley, Jenna C. Fromer et al.
5 citations
Journal of Chemical Information and Modeling
Machine Learning and Data Classification
12.40
article

Batched Bayesian Optimization by Maximizing the Probability of Including the Optimum

Austin Tripp, Runzhong Wang, Connor W. Coley, Jenna C. Fromer, José Miguel Hernández-Lobato, Mrunali Manjrekar
article en
5 citations

Abstract

Batched Bayesian optimization (BO) can accelerate molecular design by efficiently identifying top-performing compounds from a large chemical library. Existing acquisition strategies for batch design in BO aim to balance exploration and exploitation. This often involves optimizing nonadditive batch acquisition functions, necessitating approximation via myopic construction and/or diversity heuristics. In this work, we propose an acquisition strategy for discrete optimization that is motivated by pure exploitation, qPO (multipoint Probability of Optimality). qPO maximizes the probability that the batch includes the true optimum, which is expressed as the sum over individual acquisition scores and thereby circumvents the combinatorial challenge of optimizing a batch acquisition function. We differentiate the proposed strategy from parallel Thompson sampling and discuss how it implicitly captures diversity. Finally, we apply our method to the model-guided exploration of large chemical libraries and provide empirical evidence that it is competitive with and complements other state-of-the-art methods in batched Bayesian optimization.

Journal of Chemical Information and ModelingVol. 65(10)
University of Cambridge (GB), Moscow Institute of Thermal Technology (RU)
Massachusetts Institute of Technology, Alan Turing Institute, National Institute of General Medical Sciences, U.S. Naval Research Laboratory
Openalex Percentile: Top 2%
Machine Learning and Data Classification
12.40
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Batched Bayesian Optimization by Maximizing the Probability of Including the Optimum — Austin Tripp, Runzhong Wang, et al. · Journal of Chemical Information and Modeling (2025) | TGRS Research Map | TGRS