Nested Lattice Sampling: A New Sampling Scheme Derived by Randomizing Nested Orthogonal Arrays

A nested orthogonal array is an orthogonal array that contains a smaller orthogonal array as a subarray. We construct a new sampling scheme, called nested lattice sampling, by randomizing nested orthogonal arrays with nested permutations. For a pair of nested lattice samples associated with a nested orthogonal array of strength t, the points in both samples achieve uniformity in t or lower dimensions. Some statistical properties of nested lattice samples based on strength two nested orthogonal arrays are derived. The proposed sampling scheme is useful for running multifidelity computer experiments, sequential evaluation of computer models, and calibration and validation of computer models. This article has supplementary material online.

[1]  Wei-Liem Loh.  On Latin hypercube sampling , 1996 .

[2]  Carolyn Conner Seepersad,et al.  Building Surrogate Models Based on Detailed and Approximate Simulations , 2004, DAC 2004.

[3]  T. Simpson,et al.  Comparative studies of metamodelling techniques under multiple modelling criteria , 2001 .

[4]  Peter Z. G. Qian,et al.  CONSTRUCTION OF NESTED SPACE-FILLING DESIGNS , 2009, 0909.0598.

[5]  Dick den Hertog,et al.  Nested Maximin Latin Hypercube Designs in Two Dimensions , 2005 .

[6]  Peter Z. G. Qian,et al.  On the existence of nested orthogonal arrays , 2008, Discret. Math..

[7]  Peter Z. G. Qian,et al.  Bayesian Hierarchical Modeling for Integrating Low-Accuracy and High-Accuracy Experiments , 2008, Technometrics.

[8]  I. Sobol.  On the distribution of points in a cube and the approximate evaluation of integrals , 1967 .

[9]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[10]  Boxin Tang.  Orthogonal Array-Based Latin Hypercubes , 1993 .

[11]  Richard J. Beckman,et al.  A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code , 2000, Technometrics.

[12]  Wolfgang Ch. Schmid,et al.  MinT - Architecture and applications of the (t, m, s)-net and OOA database , 2010, Math. Comput. Simul..

[13]  A. Owen.  Scrambled net variance for integrals of smooth functions , 1997 .

[14]  B. Efron,et al.  The Jackknife Estimate of Variance , 1981 .

[15]  T. Simpson,et al.  Comparative studies of metamodeling techniques under multiple modeling criteria , 2000 .

[16]  Art B. Owen,et al.  Variance with alternative scramblings of digital nets , 2003, TOMC.

[17]  D. Higdon,et al.  Computer Model Calibration Using High-Dimensional Output , 2008 .

[18]  Francis Maurin.  On Incomplete Orthogonal Arrays , 1985, J. Comb. Theory, Ser. A.

[19]  A. Owen.  Monte Carlo Variance of Scrambled Net Quadrature , 1997 .

[20]  Boxin Tang,et al.  NESTED SPACE-FILLING DESIGNS FOR COMPUTER EXPERIMENTS WITH TWO LEVELS OF ACCURACY , 2009 .

[21]  Peter Z. G. Qian.  Nested Latin hypercube designs , 2009 .

[22]  I. Sloan.  Lattice Methods for Multiple Integration , 1994 .

[23]  H. D. Patterson.  The Errors of Lattice Sampling , 1954 .

[24]  A. O'Hagan,et al.  Predicting the output from a complex computer code when fast approximations are available , 2000 .

[25]  R. C. Bose,et al.  Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture , 1960, Canadian Journal of Mathematics.

[26]  A. S. Hedayat,et al.  Some Mathematical Results on Incomplete Orthogonal Arrays. , 1986 .

[27]  A multivariate central limit theorem for randomized orthogonal array sampling designs in computer experiments , 2007, 0708.0656.

[28]  H. Niederreiter.  Low-discrepancy and low-dispersion sequences , 1988 .

[29]  A. Owen.  Lattice Sampling Revisited: Monte Carlo Variance of Means Over Randomized Orthogonal Arrays , 1994 .