# Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functions

arXiv: https://arxiv.org/abs/1511.07130 · HTML: https://mlsanity.com/paper/1511.07130/

## Key facts

- Cited by 31 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 23 Nov 2015.

## Built on by (most cited first, 30 of 31)

- [Recent Advances in Bayesian Optimization](https://mlsanity.com/paper/2206.03301/) (2022)
- [Joint Entropy Search for Maximally-Informed Bayesian Optimization](https://mlsanity.com/paper/2206.04771/) (2022)
- [GIBBON: General-purpose Information-Based Bayesian OptimisatioN](https://mlsanity.com/paper/2102.03324/) (2021)
- [Joint Entropy Search for Multi-objective Bayesian Optimization](https://mlsanity.com/paper/2210.02905/) (2022)
- [Active Learning and Bayesian Optimization: a Unified Perspective to Learn with a Goal](https://mlsanity.com/paper/2303.01560/) (2023)
- [BOtied: Multi-objective Bayesian optimization with tied multivariate ranks](https://mlsanity.com/paper/2306.00344/) (2023)
- [Faster Improvement Rate Population Based Training](https://mlsanity.com/paper/2109.13800/) (2021)
- [Trusted-Maximizers Entropy Search for Efficient Bayesian Optimization](https://mlsanity.com/paper/2107.14465/) (2021)
- [Quantization Algorithms for Random Fourier Features](https://mlsanity.com/paper/2102.13079/) (2021)
- [Gaussian Max-Value Entropy Search for Multi-Agent Bayesian Optimization](https://mlsanity.com/paper/2303.05694/) (2023)
- [Advancing Deep Active Learning & Data Subset Selection: Unifying Principles with Information-Theory Intuitions](https://mlsanity.com/paper/2401.04305/) (2024)
- [Collaborative Bayesian Optimization via Wasserstein Barycenters](https://mlsanity.com/paper/2504.10770/) (2025)
- [Batch Bayesian Optimization on Permutations using the Acquisition Weighted Kernel](https://mlsanity.com/paper/2102.13382/) (2021)
- [Optimizing Posterior Samples for Bayesian Optimization via Rootfinding](https://mlsanity.com/paper/2410.22322/) (2024)
- [Pseudo-Bayesian Optimization](https://mlsanity.com/paper/2310.09766/) (2023)
- [TS-RSR: A provably efficient approach for batch Bayesian Optimization](https://mlsanity.com/paper/2403.04764/) (2024)
- [Bayesian Calibration for Activity Based Models](https://mlsanity.com/paper/2203.04414/) (2022)
- [Sampling from Gaussian Processes: A Tutorial and Applications in Global Sensitivity Analysis and Optimization](https://mlsanity.com/paper/2507.14746/) (2025)
- [Predicting the utility of search spaces for black-box optimization: a simple, budget-aware approach](https://mlsanity.com/paper/2112.08250/) (2021)
- [Batch Bayesian Optimization via Particle Gradient Flows](https://mlsanity.com/paper/2209.04722/) (2022)
- [Adaptive Experimentation at Scale: A Computational Framework for Flexible Batches](https://mlsanity.com/paper/2303.11582/) (2023)
- [Is novelty predictable?](https://mlsanity.com/paper/2306.00872/) (2023)
- [Gaussian Process Thompson Sampling via Rootfinding](https://mlsanity.com/paper/2410.08071/) (2024)
- [Batched Energy-Entropy acquisition for Bayesian Optimization](https://mlsanity.com/paper/2410.08804/) (2024)
- [Information-theoretic Bayesian Optimization: Survey and Tutorial](https://mlsanity.com/paper/2502.06789/) (2025)
- [Enhancing Trust-Region Bayesian Optimization via Newton Methods](https://mlsanity.com/paper/2508.18423/) (2025)
- [Randomized Kriging Believer for Parallel Bayesian Optimization with Regret Bounds](https://mlsanity.com/paper/2603.01470/) (2026)
- [Process-constrained batch Bayesian approaches for yield optimization in multi-reactor systems](https://mlsanity.com/paper/2408.02551/) (2024)
- [Scalable Batch Bayesian Optimization Via Subspace Acquisition Functions](https://mlsanity.com/paper/2411.16206/) (2024)
- [Information-Theoretic Bayesian Optimization for Bilevel Optimization Problems](https://mlsanity.com/paper/2509.21725/) (2025)

## Abstract (arXiv)

We develop parallel predictive entropy search (PPES), a novel algorithm for Bayesian optimization of expensive black-box objective functions. At each iteration, PPES aims to select a batch of points which will maximize the information gain about the global maximizer of the objective. Well known strategies exist for suggesting a single evaluation point based on previous observations, while far fewer are known for selecting batches of points to evaluate in parallel. The few batch selection schemes that have been studied all resort to greedy methods to compute an optimal batch. To the best of our knowledge, PPES is the first non-greedy batch Bayesian optimization strategy. We demonstrate the benefit of this approach in optimization performance on both synthetic and real world applications, including problems in machine learning, rocket science and robotics.