Abstract
Orthogonal array based space-filling designs (Owen [Statist. Sinica 2 (1992a) 439–452]; Tang [J. Amer. Statist. Assoc. 88 (1993) 1392–1397]) have become popular in computer experiments, numerical integration, stochastic optimization and uncertainty quantification. As improvements of ordinary Latin hypercube designs, these designs achieve stratification in multi-dimensions. If the underlying orthogonal array has strength tt, such designs achieve uniformity up to tt dimensions. Existing central limit theorems are limited to these designs with only two-dimensional stratification based on strength two orthogonal arrays. We develop a new central limit theorem for these designs that possess stratification in arbitrary multi-dimensions associated with orthogonal arrays of general strength. This result is useful for building confidence statements for such designs in various statistical applications.
Citation
Xu He. Peter Z. G. Qian. "A central limit theorem for general orthogonal array based space-filling designs." Ann. Statist. 42 (5) 1725 - 1750, October 2014. https://doi.org/10.1214/14-AOS1231
Information