A new optimistic lower-confidence-bound method for gray-box optimization that improves regret bounds for linear stochastic bandits via a recent multi-output least-squares confidence set result.
Bayesian Optimization with Structured Measurements: A Vector-Valued RKHS Framework
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Bayesian optimization (BO) is an efficient framework for optimizing expensive black-box functions. However, it is typically formulated as learning an end-to-end mapping from inputs to scalar objectives, thereby discarding the potentially rich information whenever a structured system output is available. In this work, we study Bayesian optimization over a vector-valued operator with structured measurements, where each measurement observes multidimensional or functional outputs, e.g., trajectories or spatial fields, rather than a single scalar value. The objective is then defined as a linear functional of these measurements. This allows each observation to reveal substantially richer information about the underlying system compared to scalar observations. Assuming the unknown operator lies in a vector-valued reproducing kernel Hilbert space (RKHS), we derive high-probability concentration bounds for the kernel ridge regression (KRR) estimator directly in the measurement space, characterizing uncertainty in a general Hilbert space. Building on these results, we propose an algorithm based on the upper confidence bound (UCB) acquisition function with regret guarantees under mild assumptions, recovering sublinear rates for common kernels. Empirically, we demonstrate that leveraging structured measurements leads to improved sample efficiency by enabling efficient transfer of information across objectives and adaptation to time-varying settings.
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Gray-Box Optimization using Optimism in the Face of Uncertainty
A new optimistic lower-confidence-bound method for gray-box optimization that improves regret bounds for linear stochastic bandits via a recent multi-output least-squares confidence set result.