mlsanityData to 7 Oct 2026

Batched Bayesian optimization by maximizing the probability of including the optimum

arXiv 2410.06333 ↗First posted 8 Oct 2024cs.LG stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 20 of its 65 references that are in the map. First posted on arXiv 8 Oct 2024.

Builds on

20 of 65 references.

References · 20

  1. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
  2. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
  3. 2014Predictive Entropy Search for Efficient Global Optimization of Black-box Functionscited by 201
  4. 2013Expectation Propagation for approximate Bayesian inferencecited by 172
  5. 2022Sample Efficiency Matters: A Benchmark for Practical Molecular Optimizationcited by 151
  6. 2023Unexpected Improvements to Expected Improvement for Bayesian Optimizationcited by 144
  7. 2020Neural Thompson Samplingcited by 127
  8. 2018Interactive Supercomputing on 40,000 Cores for Machine Learning and Data Analysiscited by 110
  9. 2015Batch Bayesian Optimization via Local Penalizationcited by 103
  10. 2017Parallel and Distributed Thompson Sampling for Large-scale Accelerated Exploration of Chemical Spacecited by 76
  11. 2017The reparameterization trick for acquisition functionscited by 61
  12. 2020Accelerating high-throughput virtual screening through molecular pool-based active learningcited by 59
8 more
  1. 2021GIBBON: General-purpose Information-Based Bayesian OptimisatioNcited by 47
  2. 2016Batched Gaussian Process Bandit Optimization via Determinantal Point Processescited by 33
  3. 2021DOCKSTRING: easy molecular docking yields better benchmarks for ligand designcited by 33
  4. 2022Sample-Then-Optimize Batch Neural Thompson Samplingcited by 25
  5. 2021Diversified Sampling for Batched Bayesian Optimization with Determinantal Point Processescited by 23
  6. 2019Integrals over Gaussians under Linear Domain Constraintscited by 15
  7. 2018Efficient and Scalable Batch Bayesian Optimization Using K-Meanscited by 5
  8. 2024TS-RSR: A provably efficient approach for batch Bayesian Optimizationcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.