Discovering a Top Group under Uncertain Inputs

Authors

  • Kenneth Jenkins Author
  • Arthur Jenkins Author
  • Grant Evans Author

Abstract

Partition search creates the candidates, while input-uncertain top-group selection determines membership among them. Evaluation needs both missed-region and membership errors. Independent checks should use declared input scenarios after discovery. Precise ordering of the discovered group cannot establish that the search found a group worth choosing from. This focused synthesis develops an empirical comparison that preserves the terminal action, observation process, and total verification cost. Its proposed tests are prospective; no new simulation run, model-training result, or intervention effect is reported.

References

  1. H. Xiao and S. Gao, “Simulation Budget Allocation for Selecting the Top-m Designs with Input Uncertainty,” IEEE Transactions on Automatic Control, vol. 63, no. 9, pp. 3127–3134, 2018.
  2. S. Gao and W. Chen, “A Partition-Based Random Search for Stochastic Constrained Optimization via Simulation,” IEEE Transactions on Automatic Control, vol. 62, no. 2, pp. 740–752, 2017.
  3. Ankenman, Bruce, Barry L. Nelson, and Jeremy Staum. “Stochastic Kriging for Simulation Metamodeling.” Operations Research, vol. 58, no. 2, 2010, pp. 371–382. https://doi.org/10.1287/opre.1090.0754.
  4. Kim, Seong-Hee, and Barry L. Nelson. “A Fully Sequential Procedure for Indifference-Zone Selection in Simulation.” ACM Transactions on Modeling and Computer Simulation, vol. 11, no. 3, 2001, pp. 251–273. https://doi.org/10.1145/502109.502111.
  5. Chick, Stephen E., and Koichiro Inoue. “New Two-Stage and Sequential Procedures for Selecting the Best Simulated System.” Operations Research, vol. 49, no. 5, 2001, pp. 732–743. https://doi.org/10.1287/opre.49.5.732.10615.
  6. Frazier, Peter I., Warren B. Powell, and Savas Dayanik. “A Knowledge-Gradient Policy for Sequential Information Collection.” SIAM Journal on Control and Optimization, vol. 47, no. 5, 2008, pp. 2410–2439. https://doi.org/10.1137/070693424.
  7. Rasmussen, Carl Edward, and Christopher K. I. Williams. Gaussian Processes for Machine Learning. MIT Press, 2006. https://gaussianprocess.org/gpml/.
  8. Sacks, Jerome, William J. Welch, Toby J. Mitchell, and Henry P. Wynn. “Design and Analysis of Computer Experiments.” Statistical Science, vol. 4, no. 4, 1989, pp. 409–423. https://doi.org/10.1214/ss/1177012413.
  9. Bertsimas, Dimitris, and Melvyn Sim. “The Price of Robustness.” Operations Research, vol. 52, no. 1, 2004, pp. 35–53. https://doi.org/10.1287/opre.1030.0065.
  10. Campi, Marco C., and Simone Garatti. “The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs.” SIAM Journal on Optimization, vol. 19, no. 3, 2008, pp. 1211–1230. https://doi.org/10.1137/07069821X.

Downloads

Published

2025-10-21