Sep 2026· Naval Research Logistics· 0 citations· 28 references
TL;DR
This work proposes an algorithm that not only tackles the issue of sample average of performance estimates generated by the optimization algorithm, but also provides a consistent online estimator for the variance of the performance.
Abstract
Black‐box optimization is often encountered for decision‐making in complex systems management, where knowledge of the system is limited. Under these circumstances, it is essential to balance the utilization of new information with computational efficiency. In practice, decision‐makers often face the dual tasks of optimization and statistical inference for the optimal performance, in order to achieve it with high reliability. Our goal is to address the dual tasks in an online fashion. Wu et al. (2025) point out that the sample average of performance estimates generated by the optimization algorithm does not necessarily admit a central limit theorem (CLT). We propose an algorithm that not only tackles this issue, but also provides a consistent online estimator for the variance of the performance. Furthermore, we characterize the convergence rate of the coverage probabilities of the asymptotic confidence intervals.
The problem of maximizing the weighted average of performance certificates in the presence of uncertainty about the true system state is shown to be equivalent to an optimization over nested prediction sets, connecting to the literature on conformal prediction and extending prior art on single-level risk-averse decisio...
A framework for optimizing parameters using sample paths drawn from a Gaussian process inferred from the information available at the start of BO, which can effectively select parameter configurations that achieve strong performance among a range of candidate configurations.
Satoshi Katayama, Shoyo Hunt, Shintaro Masuda et al.· 0 citations
Black-box optimization problems are ubiquitous across science and engineering, often dealing with expensive objective functions. This objective latency has two consequences during optimization: (i) the objective evaluation dominates execution time, and (ii) sample-efficient algorithms are crucial to accelerate developm...
G. Sutter, A. Comas-Leon, David Holzmüller et al.· 0 citations
We study continuous global optimization problems in which the objective function cannot be directly evaluated; rather, we observe only which of two selected design points appears to perform better, subject to noise. Such comparisons complicate the use of Gaussian process regression because they yield non-Gaussian poste...
This paper proposes a model-based bootstrap framework for uncertainty quantification of OPE in finite-horizon, time-inhomogeneous Markov decision processes (MDPs), and establishes bootstrap distributional consistency, asymptotically valid confidence intervals, and consistent variance estimation for the target policy va...
Wei-Wei Wang, Yu-Qiang Li, Xian-Yi Wu et al.· 0 citations
We propose Variance Driven Exploration (VarDE), a principled approach for pure exploration in highly stochastic environments, where the exploration process is dominated by stochastic variance. VarDE is built on a fundamental principle: sampling effort should be allocated to minimize the uncertainty of the final decisio...
Khang A. Luong, N. Nguyen, Ho-Ang Ta et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
