# Bayesian Optimization with Expensive Integrands

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

## Key facts

- Cited by 24 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 23 Mar 2018.

## Built on by (most cited first, 24 of 24)

- [Robust Multi-Objective Bayesian Optimization Under Input Noise](https://mlsanity.com/paper/2202.07549/) (2022)
- [Bayesian Optimization of Function Networks](https://mlsanity.com/paper/2112.15311/) (2021)
- [Thinking inside the box: A tutorial on grey-box Bayesian optimization](https://mlsanity.com/paper/2201.00272/) (2022)
- [Value-at-Risk Optimization with Gaussian Processes](https://mlsanity.com/paper/2105.06126/) (2021)
- [Active learning for distributionally robust level-set estimation](https://mlsanity.com/paper/2102.04000/) (2021)
- [Golem: An algorithm for robust experiment and process optimization](https://mlsanity.com/paper/2103.03716/) (2021)
- [BONSAI: Structure-exploiting robust Bayesian optimization for networked black-box systems under uncertainty](https://mlsanity.com/paper/2510.03893/) (2025)
- [Pseudo-Bayesian Optimization](https://mlsanity.com/paper/2310.09766/) (2023)
- [Robust Entropy Search for Safe Efficient Bayesian Optimization](https://mlsanity.com/paper/2405.19059/) (2024)
- [On the convergence rate of noisy Bayesian Optimization with Expected Improvement](https://mlsanity.com/paper/2501.09262/) (2025)
- [Robust Bayesian Target Value Optimization](https://mlsanity.com/paper/2301.04344/) (2023)
- [Bayesian Optimization for Min Max Optimization](https://mlsanity.com/paper/2107.13772/) (2021)
- [On the development of a practical Bayesian optimisation algorithm for expensive experiments and simulations with changing environmental conditions](https://mlsanity.com/paper/2402.03006/) (2024)
- [Targeted Variance Reduction: Robust Bayesian Optimization of Black-Box Simulators with Noise Parameters](https://mlsanity.com/paper/2403.03816/) (2024)
- [Contextual Bayesian optimization with binary outputs](https://mlsanity.com/paper/2111.03447/) (2021)
- [Bayesian Optimization of Expensive Nested Grey-Box Functions](https://mlsanity.com/paper/2306.05150/) (2023)
- [Bayesian Optimization for Non-Convex Two-Stage Stochastic Optimization Problems](https://mlsanity.com/paper/2408.17387/) (2024)
- [Discovery of Feasible 3D Printing Configurations for Metal Alloys via AI-driven Adaptive Experimental Design](https://mlsanity.com/paper/2601.17587/) (2026)
- [Bayesian Quadrature](https://mlsanity.com/paper/2602.16218/) (2026)
- [On Practical Reinforcement Learning: Provable Robustness, Scalability, and Statistical Efficiency](https://mlsanity.com/paper/2203.01758/) (2022)
- [Learning Relevant Contextual Variables Within Bayesian Optimization](https://mlsanity.com/paper/2305.14120/) (2023)
- [Bayesian Optimization for General Reaction Conditions](https://mlsanity.com/paper/2502.18966/) (2025)
- [Stochastic Gradient Descent with Strategic Querying](https://mlsanity.com/paper/2508.17144/) (2025)
- [Maximally Robust Satisficing Bayesian Optimization](https://mlsanity.com/paper/2607.13652/) (2026)

## Abstract (arXiv)

We propose a Bayesian optimization algorithm for objective functions that are sums or integrals of expensive-to-evaluate functions, allowing noisy evaluations. These objective functions arise in multi-task Bayesian optimization for tuning machine learning hyperparameters, optimization via simulation, and sequential design of experiments with random environmental conditions. Our method is average-case optimal by construction when a single evaluation of the integrand remains within our evaluation budget. Achieving this one-step optimality requires solving a challenging value of information optimization problem, for which we provide a novel efficient discretization-free computational method. We also provide consistency proofs for our method in both continuum and discrete finite domains for objective functions that are sums. In numerical experiments comparing against previous state-of-the-art methods, including those that also leverage sum or integral structure, our method performs as well or better across a wide range of problems and offers significant improvements when evaluations are noisy or the integrand varies smoothly in the integrated variables.