Ranking and Selection: A New Sequential Bayesian Procedure for Use with Common Random Numbers
Bj\"orn G\"order, Michael Kolonko

TL;DR
This paper introduces a Bayesian sequential procedure for ranking and selecting the best systems based on dependent, normally distributed observations, effectively handling common random numbers and reducing simulation effort.
Contribution
It proposes a novel Bayesian method that accounts for dependence in observations and approximates complex posteriors, improving efficiency over existing procedures.
Findings
Uses fewer simulations than comparable methods
Effectively handles positively dependent observations
Maintains error probabilities below bounds in most cases
Abstract
We want to select the best systems out of a given set of systems (or rank them) with respect to their expected performance. The systems allow random observations only and we assume that the joint observation of the systems has a multivariate normal distribution with unknown mean and covariance. We allow dependent marginal observations as they occur when common random numbers are used for the simulation of the systems. In particular, we focus on positively dependent observations as they might be expected in heuristic optimization where `systems' are different solutions to an optimization problem with common random inputs. In each iteration, we allocate a fixed budget of simulation runs to the solutions. We use a Bayesian setup and allocate the simulation effort according to the posterior covariances of the solutions until the ranking and selection decision is correct with a given high…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSimulation Techniques and Applications · Spreadsheets and End-User Computing · Advanced Statistical Process Monitoring
