Batched Bayesian optimization by maximizing the probability of including the optimum
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908352416579584 |
|---|---|
| author | Fromer, Jenna Wang, Runzhong Manjrekar, Mrunali Tripp, Austin Hernández-Lobato, José Miguel Coley, Connor W. |
| author_facet | Fromer, Jenna Wang, Runzhong Manjrekar, Mrunali Tripp, Austin Hernández-Lobato, José Miguel Coley, Connor W. |
| contents | 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 non-additive 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 expressible 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_06333 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Batched Bayesian optimization by maximizing the probability of including the optimum Fromer, Jenna Wang, Runzhong Manjrekar, Mrunali Tripp, Austin Hernández-Lobato, José Miguel Coley, Connor W. Machine Learning 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 non-additive 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 expressible 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. |
| title | Batched Bayesian optimization by maximizing the probability of including the optimum |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2410.06333 |