LHS in LHS: A new expansion strategy for Latin hypercube sampling in simulation design

Abstract

Latin Hypercube Sampling (LHS) is a prominent tool in simulation design, with a variety of applications in high-dimensional and computationally expensive problems. LHS allows for various optimization strategies, most notably to ensure space-filling properties. However, LHS is a single-stage algorithm that requires a priori knowledge of the targeted sample size. In this work, we present LHS in LHS, a new expansion algorithm for LHS that enables the addition of new samples to an existing LHS-distributed set while (approximately) preserving its properties. In summary, the algorithm identifies regions of the parameter space that are far from the initial set, draws a new LHS within those regions, and then merges it with the original samples. As a by-product, we introduce a new metric, the LHS degree, which quantifies the deviation of a given design from an LHS distribution. Our public implementation is distributed via the Python package expandLHS.

8 pages, 5 figures

References in corpus (8)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Array Programming with NumPy
• Surrogate models for precessing binary black hole simulations with unequal masses
• Mining Gravitational-wave Catalogs To Understand Binary Stellar Evolution: A New Hierarchical Bayesian Framework
• Deep learning and Bayesian inference of gravitational-wave populations: Hierarchical black-hole mergers
• Learning Curves for Decision Making in Supervised Machine Learning: A Survey
• Extending black-hole remnant surrogate models to extreme mass ratios
• A Novel Constrained Sampling Method for Efficient Exploration in Materials and Chemical Mixture Design