Safe Bayesian optimization across noise models via scenario programming

• URL: http://arxiv.org/abs/2512.11580v1
• Date: Fri, 12 Dec 2025 14:08:46 GMT
• Title: Safe Bayesian optimization across noise models via scenario programming
• Authors: Abdullah Tokmak, Thomas B. Schön, Dominik Baumann,
• Abstract summary: We propose a straightforward yet rigorous approach for safe BO across noise models, including homoscedastic sub-Gaussian and heteroscedastic heavy-tailed distributions.<n>We deploy our algorithm in synthetic examples and in tuning a controller for the Franka Emika manipulator in simulation.
• Score: 11.66003972374653
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Towards safe Bayesian optimization with Wiener kernel regression [0.6554326244334868]
  We present a novel error bound based on the recently proposed Wiener kernel regression.<n>We prove that under rather mild assumptions, the proposed error bound is tighter than bounds previously documented in the literature.<n>We draw upon a numerical example to demonstrate the efficacy of the proposed error bound in safe BO.
  arXiv  Detail & Related papers  (2024-11-04T16:43:16Z)
• Optimizing Falsification for Learning-Based Control Systems: A Multi-Fidelity Bayesian Approach [40.58350379106314]
  falsification problem involves the identification of counterexamples that violate system safety requirements. We propose a multi-fidelity Bayesian optimization falsification framework that harnesses simulators with varying levels of accuracy.
  arXiv  Detail & Related papers  (2024-09-12T14:51:03Z)
• PACSBO: Probably approximately correct safe Bayesian optimization [10.487548576958421]
  We propose an algorithm that estimates an upper bound on the RKHS norm of an unknown function from data. We treat the RKHS norm as a local rather than a global object, and thus reduce conservatism. Integrating the RKHS norm estimation and the local interpretation of the RKHS norm into a safe BO algorithm yields PACSBO.
  arXiv  Detail & Related papers  (2024-09-02T10:50:34Z)
• Information-Theoretic Safe Bayesian Optimization [59.758009422067005]
  We consider a sequential decision making task, where the goal is to optimize an unknown function without evaluating parameters that violate an unknown (safety) constraint. Most current methods rely on a discretization of the domain and cannot be directly extended to the continuous case. We propose an information-theoretic safe exploration criterion that directly exploits the GP posterior to identify the most informative safe parameters to evaluate.
  arXiv  Detail & Related papers  (2024-02-23T14:31:10Z)
• Towards Safe Multi-Task Bayesian Optimization [1.3654846342364308]
  Reduced physical models of the system can be incorporated into the optimization process, accelerating it. These models are able to offer an approximation of the actual system, and evaluating them is significantly cheaper. Safety is a crucial criterion for online optimization methods such as Bayesian optimization.
  arXiv  Detail & Related papers  (2023-12-12T13:59:26Z)
• Bayesian Optimization with Formal Safety Guarantees via Online Conformal Prediction [36.14499894307206]
  Black-box zero-th order optimization is a central primitive for applications in fields as diverse as finance, physics, and engineering. In this paper, we study scenarios in which feedback is also provided on the safety of the attempted solution. A novel BO-based approach is introduced that satisfies safety requirements irrespective of properties of the constraint function.
  arXiv  Detail & Related papers  (2023-06-30T17:26:49Z)
• Robust Control for Dynamical Systems With Non-Gaussian Noise via Formal Abstractions [59.605246463200736]
  We present a novel controller synthesis method that does not rely on any explicit representation of the noise distributions. First, we abstract the continuous control system into a finite-state model that captures noise by probabilistic transitions between discrete states. We use state-of-the-art verification techniques to provide guarantees on the interval Markov decision process and compute a controller for which these guarantees carry over to the original control system.
  arXiv  Detail & Related papers  (2023-01-04T10:40:30Z)
• Benefits of Monotonicity in Safe Exploration with Gaussian Processes [50.71125084216603]
  We consider the problem of sequentially maximising an unknown function over a set of actions. We show that textscsffamily M-SafeUCB enjoys theoretical guarantees in terms of safety, a suitably-defined regret notion, and approximately finding the entire safe boundary.
  arXiv  Detail & Related papers  (2022-11-03T02:52:30Z)
• Meta-Learning Priors for Safe Bayesian Optimization [72.8349503901712]
  We build on a meta-learning algorithm, F-PACOH, capable of providing reliable uncertainty quantification in settings of data scarcity. As core contribution, we develop a novel framework for choosing safety-compliant priors in a data-riven manner. On benchmark functions and a high-precision motion system, we demonstrate that our meta-learned priors accelerate the convergence of safe BO approaches.
  arXiv  Detail & Related papers  (2022-10-03T08:38:38Z)
• Log Barriers for Safe Black-box Optimization with Application to Safe Reinforcement Learning [72.97229770329214]
  We introduce a general approach for seeking high dimensional non-linear optimization problems in which maintaining safety during learning is crucial. Our approach called LBSGD is based on applying a logarithmic barrier approximation with a carefully chosen step size. We demonstrate the effectiveness of our approach on minimizing violation in policy tasks in safe reinforcement learning.
  arXiv  Detail & Related papers  (2022-07-21T11:14:47Z)
• Sampling-Based Robust Control of Autonomous Systems with Non-Gaussian Noise [59.47042225257565]
  We present a novel planning method that does not rely on any explicit representation of the noise distributions. First, we abstract the continuous system into a discrete-state model that captures noise by probabilistic transitions between states. We capture these bounds in the transition probability intervals of a so-called interval Markov decision process (iMDP)
  arXiv  Detail & Related papers  (2021-10-25T06:18:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.