Home > Research > Publications & Outputs > Optimal allocation of Monte Carlo simulations t...


Text available via DOI:

View graph of relations

Optimal allocation of Monte Carlo simulations to multiple hypothesis tests

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>1/05/2020
<mark>Journal</mark>Statistics and Computing
Issue number3
Number of pages16
Pages (from-to)571-586
Publication StatusPublished
Early online date5/10/19
<mark>Original language</mark>English


Multiple hypothesis tests are often carried out in practice using p-value estimates obtained with bootstrap or permutation tests since the analytical p-values underlying all hypotheses are usually unknown. This article considers the allocation of a pre-specified total number of Monte Carlo simulations K∈ N (i.e., permutations or draws from a bootstrap distribution) to a given number of m∈ N hypotheses in order to approximate their p-values p∈ [0 , 1] m in an optimal way, in the sense that the allocation minimises the total expected number of misclassified hypotheses. A misclassification occurs if a decision on a single hypothesis, obtained with an approximated p-value, differs from the one obtained if its p-value was known analytically. The contribution of this article is threefold: under the assumption that p is known and K∈ R, and using a normal approximation of the Binomial distribution, the optimal real-valued allocation of K simulations to m hypotheses is derived when correcting for multiplicity with the Bonferroni correction, both when computing the p-value estimates with or without a pseudo-count. Computational subtleties arising in the former case will be discussed. Second, with the help of an algorithm based on simulated annealing, empirical evidence is given that the optimal integer allocation is likely of the same form as the optimal real-valued allocation, and that both seem to coincide asympotically. Third, an empirical study on simulated and real data demonstrates that a recently proposed sampling algorithm based on Thompson sampling asympotically mimics the optimal (real-valued) allocation when the p-values are unknown and thus estimated at runtime.