Metraipolis › archive › dc_65ca64a58018
One-Shot Screening of Simulated Systems for Acceptability — arXiv:2609.04400
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.04400
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T23:09:43.971Z
- SHA-256 of the archived text
a6af2fd36a145876cc4cecf4f0745f1842ce3f6b692db58296c42797a3cb069a- Stable URL of this page
https://metraipolis.com/documento/dc_65ca64a58018
How to cite
One-Shot Screening of Simulated Systems for Acceptability — arXiv:2609.04400 — arXiv (en), https://arxiv.org/abs/2609.04400 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_65ca64a58018 (Metraipolis archive dc_65ca64a58018, sha256 a6af2fd36a145876cc4cecf4f0745f1842ce3f6b692db58296c42797a3cb069a)
BibTeX
@misc{dc65ca64a58018,
title = {One-Shot Screening of Simulated Systems for Acceptability — arXiv:2609.04400},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.04400},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_65ca64a58018; sha256 a6af2fd36a145876cc4cecf4f0745f1842ce3f6b692db58296c42797a3cb069a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.04400. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-07 in stat.AP). Categorie arXiv: Applications (stat.AP). Pagina del lavoro: https://arxiv.org/abs/2609.04400 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T22:51:09.088Z dalla pagina https://arxiv.org/catchup/stat.AP/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).