A general theory for orthogonal array based Latin hypercube sampling
From MaRDI portal
Recommendations
- Orthogonal Array-Based Latin Hypercubes
- A multivariate central limit theorem for randomized orthogonal array sampling designs in computer experiments
- scientific article; zbMATH DE number 775913
- scientific article; zbMATH DE number 410129
- Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
Cited in
(13)- A central limit theorem for marginally coupled designs
- Representative points for distribution recovering
- scientific article; zbMATH DE number 410129 (Why is no real title available?)
- Uniformity of saturated orthogonal arrays
- Flexible sliced designs for computer experiments
- Construction of orthogonal arrays of strength three by augmented difference schemes
- Estimates of the coverage of parameter space by Latin hypercube and orthogonal array-based sampling
- Design for Sequential Follow-Up Experiments in Computer Emulations
- Searching for optimal Latin hypercube designs by a local greedy strategy
- Hilbert space analysis of latin hypercube sampling
- A review on design inspired subsampling for big data
- Asymptotic distributions of a new type of design-based incomplete U-statistics
- Reducing the statistical error of generative adversarial networks using space-filling sampling
This page was built for publication: A general theory for orthogonal array based Latin hypercube sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796880)
