Adaptive Grid Designs for Classifying Monotonic Binary Deterministic Computer Simulations

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Bai, Tian, Wang, Dianpeng, Chen, Kuangqi, He, Xu
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866908392966062080
author Bai, Tian
Wang, Dianpeng
Chen, Kuangqi
He, Xu
author_facet Bai, Tian
Wang, Dianpeng
Chen, Kuangqi
He, Xu
contents This research is motivated by the need for effective classification in ice-breaking dynamic simulations, aimed at determining the conditions under which an underwater vehicle will break through the ice. This simulation is extremely time-consuming and yields deterministic, binary, and monotonic outcomes. Detecting the critical edge between the negative-outcome and positive-outcome regions with minimal simulation runs necessitates an efficient experimental design for selecting input values. In this paper, we derive lower bounds on the number of functional evaluations needed to ensure a certain level of classification accuracy for arbitrary static and adaptive designs. We also propose a new class of adaptive designs called adaptive grid designs, which are sequences of grids with increasing resolution such that lower resolution grids are proper subsets of higher resolution grids. By prioritizing simulation runs at lower resolution points and skipping redundant runs, adaptive grid designs require the same order of magnitude of runs as the best possible adaptive design, which is an order of magnitude fewer than the best possible static design. Numerical results across test functions, the road crash simulation and the ice-breaking simulation validate the superiority of adaptive grid designs.
format Preprint
id arxiv_https___arxiv_org_abs_2506_03815
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Adaptive Grid Designs for Classifying Monotonic Binary Deterministic Computer Simulations
Bai, Tian
Wang, Dianpeng
Chen, Kuangqi
He, Xu
Methodology
62K99, 62L05
This research is motivated by the need for effective classification in ice-breaking dynamic simulations, aimed at determining the conditions under which an underwater vehicle will break through the ice. This simulation is extremely time-consuming and yields deterministic, binary, and monotonic outcomes. Detecting the critical edge between the negative-outcome and positive-outcome regions with minimal simulation runs necessitates an efficient experimental design for selecting input values. In this paper, we derive lower bounds on the number of functional evaluations needed to ensure a certain level of classification accuracy for arbitrary static and adaptive designs. We also propose a new class of adaptive designs called adaptive grid designs, which are sequences of grids with increasing resolution such that lower resolution grids are proper subsets of higher resolution grids. By prioritizing simulation runs at lower resolution points and skipping redundant runs, adaptive grid designs require the same order of magnitude of runs as the best possible adaptive design, which is an order of magnitude fewer than the best possible static design. Numerical results across test functions, the road crash simulation and the ice-breaking simulation validate the superiority of adaptive grid designs.
title Adaptive Grid Designs for Classifying Monotonic Binary Deterministic Computer Simulations
topic Methodology
62K99, 62L05
url https://arxiv.org/abs/2506.03815