Some large deviations results for Latin hypercube sampling

Large deviations theory is a well-studied area which has shown to have numerous applications. The typical results, however, assume that the underlying random variables are either i.i.d. or exhibit some form of Markovian dependence. Our interest in this paper is to study the validity of large deviations results in the context of estimators built with Latin hypercube sampling, a well-known sampling technique for variance reduction. We show that a large deviation principle holds for Latin hypercube sampling for functions in one dimension and for separable multidimensional functions. Moreover, the upper bound of the probability of a large deviation in these cases is no higher under Latin hypercube sampling than it is under Monte Carlo sampling. We extend the latter property to functions that preserve negative dependence (such as functions that are monotone in each argument). Numerical experiments illustrate the theoretical results presented in the paper.