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

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 .

Authors

Institutions

Publication Details

Journal
SoftwareX
Published
2025-08-15
DOI
https://doi.org/10.1016/j.softx.2025.102294
Citations
3
Primary Topic
Advanced Multi-Objective Optimization Algorithms
Type
article
Field-Weighted Citation Impact
4.51
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

M. Falcone, Davide Gerosa, Matteo Boschini, Alessandro Crespi
3 citations
SoftwareX
Advanced Multi-Objective Optimization Algorithms
4.51
article

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

M. Falcone, Davide Gerosa, Matteo Boschini, Alessandro Crespi
article en
3 citations

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 .

SoftwareXVol. 31
University of Milan (IT), Istituto Nazionale di Fisica Nucleare, Sezione di Milano Bicocca (IT), University of Milano-Bicocca (IT)
Openalex Percentile: Top 5%
Advanced Multi-Objective Optimization Algorithms
4.51
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.