Replicated Computations Results (RCR) report for "reusing Search Data in Ranking and Selection: What Could Possibly Go Wrong?"

Xianyu Kuang, L. Jeff Hong

Research output: Contribution to journalArticlepeer-review

Abstract

"Reusing Search Data in Ranking and Selection: What Could Possibly Go Wrong?" [2] by Eckman and Henderson rigorously defines the statistical guarantees for ranking-and-selection (R&S) procedures after random search, and points out that the simulation replications collected in the search phase are conditionally dependent given the sequence of returned systems. Therefore, reusing the search data for R&S may affect the statistical guarantees. The authors further design random search algorithms to demonstrate that the correct selection guarantees of some ranking-and-selection procedures will be compromised if reusing the simulation replications taken during the search. This replicated computation report focuses on the reproducibility of the experiment results in the aforementioned article.

Original languageEnglish (US)
Article numberA19
JournalACM Transactions on Modeling and Computer Simulation
Volume28
Issue number3
DOIs
StatePublished - Aug 2018
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2018 ACM.

Keywords

  • Random search
  • Ranking and selection
  • Simulation optimization

Fingerprint

Dive into the research topics of 'Replicated Computations Results (RCR) report for "reusing Search Data in Ranking and Selection: What Could Possibly Go Wrong?"'. Together they form a unique fingerprint.

Cite this