Centered $L_2$-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs

DOI10.1090/S0025-5718-00-01281-3zbMath0977.68091OpenAlexW1964971655MaRDI QIDQ2759097

Chang-Xing Ma, Kai-Tai Fang, Peter Winker

Publication date: 10 December 2001

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-00-01281-3

zbMATH Keywords

quasi-Monte Carlo methods uniform design Latin hypercube design threshold accepting heuristic

Mathematics Subject Classification ID

Design of statistical experiments (62K99) Computer science aspects of computer-aided design (68U07) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (34)

Surrogate‐based methods for black‐box optimization ⋮ Discrete particle swarm optimization for constructing uniform design on irregular regions ⋮ Uniform minimum moment aberration designs ⋮ Space-filling experimental designs for constrained design spaces ⋮ LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model ⋮ Lower bound of average centeredL2-discrepancy forU-type designs ⋮ An effective construction method for multi-level uniform designs ⋮ Smart sampling and incremental function learning for very large high dimensional data ⋮ Construction of main effects plans orthogonal through the block factor based on level permutation ⋮ Expected integration approximation under general equal measure partition ⋮ A new variable selection method for uniform designs ⋮ A note on construction of nearly uniform designs with large number of runs. ⋮ Uniform design over general input domains with applications to target region estimation in computer experiments ⋮ Optimized $U$-type designs on flexible regions ⋮ Lower bounds for centered and wrap-around $L_2$-discrepancies and construction of uniform designs by threshold accepting. ⋮ Two- and three-level lower bounds for mixture $L_2$-discrepancy and construction of uniform designs by threshold accepting ⋮ An algorithm for fast optimal Latin hypercube design of experiments ⋮ Optimal aggregation of linear time series models ⋮ Mean field model for collective motion bistability ⋮ An efficient algorithm for constructing optimal design of computer experiments ⋮ Statistical properties of generalized discrepancies ⋮ Non-uniform random sampling and reconstruction in signal spaces with finite rate of innovation ⋮ Nearly uniform design construction on flexible region ⋮ A study on design uniformity under errors in the level values ⋮ Lower bounds and stochastic optimization algorithms for uniform designs with three or four levels ⋮ Construction of uniform designs for mixture experiments with complex constraints ⋮ Optimizing Latin hypercube designs by particle swarm ⋮ Measures of uniformity in experimental designs: A selective overview ⋮ Optimal Noncollapsing Space-Filling Designs for Irregular Experimental Regions ⋮ Sliced symmetrical Latin hypercube designs ⋮ Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments ⋮ A note on near-orthogonal Latin hypercubes with good space-filling properties ⋮ Lower bounds for wrap-around $L_2$-discrepancy and constructions of symmetrical uniform designs ⋮ Majorization framework for balanced lattice designs

Cites Work

This page was built for publication: Centered $L_2$-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs