One-Shot Screening of Simulated Systems for Acceptability
Abstract
We introduce a general-purpose framework for designing screening procedures for problems featuring a finite set of simulated systems, a.k.a. ranking-and-selection problems. The framework offers a novel perspective on screening in which decisions to retain or eliminate systems are based on confidence regions for the unknown problem instance rather than comparisons of estimated performances. Specifically, a system is retained if it has acceptable performance under some plausible configuration of response vectors contained in the confidence region. This perspective facilitates the design of procedures that guarantee to return either all acceptable systems, or each acceptable system, with high probability and accommodates many well-studied definitions of acceptability, including feasibility with respect to stochastic constraints and optimality with respect to one or more objectives. We further study a subclass of the framework that yields simple and computationally efficient screening procedures that often have lower-order time complexity than existing methods and naturally supports parallelization without loss of screening power. We demonstrate the effectiveness and efficiency of the procedures through numerical experiments.
Related
- Shot-location polarization and post-2018 pace stabilization in the NBA: Evidence from 21 seasons of team and shot-coordinate data (2004–2025)
- Simulated Annealing for Model‐Robust Partial Profile Choice Designs in Healthcare Preference Studies
- Active Learning under Simulated Class Imbalance and Label Shift in Binary Semantic Segmentation
- InfoAtlas: A Foundation Model for Zero-Shot Statistical Dependence Estimate
- One-Shot any Code
BibTeX
@misc{zhao2026oneshot,
title = {{One-Shot Screening of Simulated Systems for Acceptability}},
author = {Jinbo Zhao and David J. Eckman},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.04400},
eprint = {2609.04400},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.04400},
}
RIS
TY - UNPB
TI - One-Shot Screening of Simulated Systems for Acceptability
AU - Jinbo Zhao
AU - David J. Eckman
PY - 2026
DA - 2026/09/03
PB - arXiv
DO - 10.48550/arxiv.2609.04400
UR - https://arxiv.org/abs/2609.04400
AB - We introduce a general-purpose framework for designing screening procedures for problems featuring a finite set of simulated systems, a.k.a. ranking-and-selection problems. The framework offers a novel perspective on screening in which decisions to retain or eliminate systems are based on confidence regions for the unknown problem instance rather than comparisons of estimated performances. Specifically, a system is retained if it has acceptable performance under some plausible configuration of response vectors contained in the confidence region. This perspective facilitates the design of procedures that guarantee to return either all acceptable systems, or each acceptable system, with high probability and accommodates many well-studied definitions of acceptability, including feasibility with respect to stochastic constraints and optimality with respect to one or more objectives. We further study a subclass of the framework that yields simple and computationally efficient screening procedures that often have lower-order time complexity than existing methods and naturally supports parallelization without loss of screening power. We demonstrate the effectiveness and efficiency of the procedures through numerical experiments.
ER -