Orthogonal Array-Based Latin Hypercubes
From MaRDI portal
Publication:4292120
DOI10.2307/2291282zbMath0792.62066OpenAlexW4251844921WikidataQ56428719 ScholiaQ56428719MaRDI QIDQ4292120
Publication date: 10 July 1994
Full work available at URL: https://doi.org/10.2307/2291282
Design of statistical experiments (62K99) Probabilistic methods, stochastic differential equations (65C99)
Related Items
Optimization of a large-scale water reservoir network by stochastic dynamic programming with efficient state space discretization ⋮ Construction of column-orthogonal strong orthogonal arrays ⋮ Efficient emulators for scattering using eigenvector continuation ⋮ Construction of space-filling orthogonal designs ⋮ A Framework for Controlling Sources of Inaccuracy in Gaussian Process Emulation of Deterministic Computer Experiments ⋮ On the Instability Issue of Gradient-Enhanced Gaussian Process Emulators for Computer Experiments ⋮ An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design ⋮ Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming ⋮ Neural network and regression spline value function approximations for stochastic dynamic programming ⋮ A new and flexible design construction for orthogonal arrays for modern applications ⋮ Construction of group strong orthogonal arrays of strength two plus ⋮ LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model ⋮ Construction of uniform \(U\)-designs ⋮ Construction of nested orthogonal arrays of parallel-flats type ⋮ Construction of improved branching Latin hypercube designs ⋮ Using nonregular designs to generate space-filling designs ⋮ Polynomial chaos expansion approach to interest rate models ⋮ Construction of orthogonal arrays of strength three by augmented difference schemes ⋮ Some results on the construction of sliced orthogonal arrays of parallel-flats type ⋮ Marginally coupled designs for two-level qualitative factors ⋮ A simple approach to constructing quasi-Sudoku-based sliced space-filling designs ⋮ Subset selection from large datasets for kriging modeling ⋮ Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions ⋮ An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions ⋮ A theorem for selecting oa-based latin hypercubes using a distance criterion ⋮ Sequential design strategies for mean response surface metamodeling via stochastic kriging with adaptive exploration and exploitation ⋮ Resolvable orthogonal array-based uniform sliced Latin hypercube designs ⋮ Construction of uniform projection designs via level permutation and expansion ⋮ Construction of marginally coupled designs by subspace theory ⋮ Construction of column-orthogonal designs for computer experiments ⋮ Orthogonal designs for computer experiments ⋮ Setting targets for surrogate-based optimization ⋮ Block-circulant matrices for constructing optimal Latin hypercube designs ⋮ Unnamed Item ⋮ Block-regularized repeated learning-testing for estimating generalization error ⋮ A new class of Latin hypercube designs with high-dimensional hidden projective uniformity ⋮ Projection array based designs for computer experiments ⋮ Alternative sampling methods for estimating multivariate normal probabilities ⋮ Accurate emulators for large-scale computer experiments ⋮ A characterization of strong orthogonal arrays of strength three ⋮ On the construction of nested space-filling designs ⋮ Optimum design accounting for the global nonlinear behavior of the model ⋮ Sliced Latin hypercube designs via orthogonal arrays ⋮ Space-filling Latin hypercube designs based on randomization restrictions in factorial experiments ⋮ A central limit theorem for marginally coupled designs ⋮ Sliced space-filling designs with different levels of two-dimensional uniformity ⋮ On the asymptotic distribution of scrambled net quadrature. ⋮ Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search ⋮ Uniform projection designs ⋮ A multivariate central limit theorem for randomized orthogonal array sampling designs in computer experiments ⋮ Parameterization, geometric modeling, and isogeometric analysis of tricuspid valves ⋮ A novel fractional moments-based maximum entropy method for high-dimensional reliability analysis ⋮ Column-orthogonal nearly strong orthogonal arrays ⋮ Uniformity of saturated orthogonal arrays ⋮ Strong orthogonal arrays of strength two-plus based on the Addelman-Kempthorne method ⋮ Construction of space-filling orthogonal Latin hypercube designs ⋮ Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs ⋮ Nearly column-orthogonal designs based on leave-one-out good lattice point sets ⋮ Rapid design of metamaterials via multitarget Bayesian optimization ⋮ Strong orthogonal arrays of strength two plus ⋮ An isomorphism check for two-level fractional factorial designs ⋮ Orthogonal-column Latin hypercube designs with small samples ⋮ Design of computer experiments: space filling and beyond ⋮ Centered $L_2$-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs ⋮ Algorithms for generating maximin Latin hypercube and orthogonal designs ⋮ Follow-up experimental designs for computer models and physical processes ⋮ Computer experiments: a review ⋮ Comparing and generating Latin hypercube designs in kriging models ⋮ An efficient algorithm for constructing optimal design of computer experiments ⋮ Recent developments in nonregular fractional factorial designs ⋮ Pitfalls of using a single criterion for selecting experimental designs ⋮ Batch sequential designs for computer experiments ⋮ Sample average approximation under non-i.i.d. sampling for stochastic empty container repositioning problem ⋮ Unnamed Item ⋮ Efficient bootstrap methods: A review ⋮ Construction of orthogonal Latin hypercube designs with flexible run sizes ⋮ Construction results for strong orthogonal arrays of strength three ⋮ Factor analysis with (mixed) observed and latent variables in the exponential family ⋮ Orthogonal Latin hypercube designs from generalized orthogonal designs ⋮ Column-orthogonal designs with multi-dimensional stratifications ⋮ Calibration for computer experiments with binary responses and application to cell adhesion study ⋮ Maximin distance designs based on densest packings ⋮ Estimates of the coverage of parameter space by Latin hypercube and orthogonal array-based sampling ⋮ A generalized Gaussian process model for computer experiments with binary time series ⋮ Optimizing Latin hypercube designs by particle swarm ⋮ Global fitting of the response surface via estimating multiple contours of a simulator ⋮ Construction of mixed orthogonal arrays with high strength ⋮ \(\mathcal G\)-SELC: optimization by sequential elimination of level combinations using genetic algorithms and Gaussian processes ⋮ A combinatorial central limit theorem for randomized orthogonal array sampling designs ⋮ Connecting U-type designs before and after level permutations and expansions ⋮ Efficient emulators of computer experiments using compactly supported correlation functions, with an application to cosmology ⋮ Visual Contrast Preserving Representation of High Dynamic Range Mathematical Functions ⋮ Uncertainty quantification of a computer model for binary black hole formation ⋮ Construction of nested space-filling designs ⋮ Algorithmic construction of optimal symmetric Latin hypercube designs. ⋮ Comparison of designs for computer experiments ⋮ A study of orthogonal array-based designs under a broad class of space-filling criteria ⋮ Generalised latent assimilation in heterogeneous reduced spaces with machine learning surrogate models ⋮ Representative points for distribution recovering ⋮ Approximate solutions of continuous dispersion problems ⋮ On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments ⋮ Samurai Sudoku-Based Space-Filling Designs for Data Pooling ⋮ Algorithmic construction of nearly column-orthogonal designs ⋮ Construction of strong group-orthogonal arrays ⋮ The geometry of diagonal groups ⋮ A model-free shrinking-dimer saddle dynamics for finding saddle point and solution landscape ⋮ Cluster sampling for Morris method made easy ⋮ Doubly Coupled Designs for Computer Experiments With Both Qualitative and Quantitative Factors ⋮ Uniform Projection Designs and Strong Orthogonal Arrays ⋮ A unifying implementation of stratum (aka strong) orthogonal arrays ⋮ Exploratory ensemble designs for environmental models using k‐extended Latin Hypercubes ⋮ Level Set Learning with Pseudoreversible Neural Networks for Nonlinear Dimension Reduction in Function Approximation ⋮ Optimal Simulator Selection ⋮ A mathematical framework for the emergence of winners and losers in cell competition ⋮ Sudoku Latin Square Sampling for Markov Chain Simulation ⋮ DESIGN BASED INCOMPLETE U-STATISTICS ⋮ Rotation designs for experiments in high-bias situations ⋮ A Uniform Bound on a Combinatorial Central Limit Theorem for Randomized Orthogonal Array Sampling Designs ⋮ Space-filling orthogonal arrays of strength two ⋮ Maximum expected entropy transformed Latin hypercube designs ⋮ Latin hypercube designs based on strong orthogonal arrays and Kriging modelling to improve the payload distribution of trains ⋮ CosmicNet. Part I. Physics-driven implementation of neural networks within Einstein-Boltzmann Solvers ⋮ A Scientific Tour on Orthogonal Arrays
