Nested adaptive grid designs hit the optimal worst-case run count v^{-(p-1)} for classifying monotonic binary simulations, an order of magnitude fewer than the v^{-p} needed by static designs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ME 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Adaptive Grid Designs for Classifying Monotonic Binary Deterministic Computer Simulations
Nested adaptive grid designs hit the optimal worst-case run count v^{-(p-1)} for classifying monotonic binary simulations, an order of magnitude fewer than the v^{-p} needed by static designs.