Safe Bayesian optimization across noise models via scenario programming
Not on the map. Why?
Abstract (arXiv)
Safe Bayesian optimization (BO) with Gaussian processes is an effective tool for tuning control policies in safety-critical real-world systems, specifically due to its sample efficiency and safety guarantees. However, most safe BO algorithms assume homoscedastic sub-Gaussian measurement noise, an assumption that does not hold in many relevant applications. In this article, we propose a straightforward yet rigorous approach for safe BO across noise models, including homoscedastic sub-Gaussian and heteroscedastic heavy-tailed distributions. We provide a high-probability bound on the measurement noise via the scenario approach, integrate these bounds into high probability confidence intervals, and prove safety and optimality for our proposed safe BO algorithm. We deploy our algorithm in synthetic examples and in tuning a controller for the Franka Emika manipulator in simulation.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 12 of its 23 references that are in the map. First posted on arXiv 12 Dec 2025.
Builds on
12 of 23 references.
References · 12
- 2017On Kernelized Multi-armed Banditscited by 348
- 2016Bayesian Optimization with Safety Constraints: Safe and Automatic Parameter Tuning in Roboticscited by 134
- 2018Information Directed Sampling and Bandits with Heteroscedastic Noisecited by 75
- 2021Practical and Rigorous Uncertainty Bounds for Gaussian Process Regressioncited by 49
- 2018Almost Optimal Algorithms for Linear Stochastic Bandits with Heavy-Tailed Payoffscited by 31
- 2019Bayesian Optimization under Heavy-tailed Payoffscited by 21
- 2021Risk-averse Heteroscedastic Bayesian Optimizationcited by 17
- 2022GoSafeOpt: Scalable Safe Exploration for Global Optimization of Dynamical Systemscited by 17
- 2023Automatic nonlinear MPC approximation with closed-loop guaranteescited by 12
- 2025Safe exploration in reproducing kernel Hilbert spacescited by 10
- 2024PACSBO: Probably approximately correct safe Bayesian optimizationcited by 8
- 2025Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewardscited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.