Latin hypercube sampling with inequality constraints
Matthieu Petelet (CEA-DEN), Bertrand Iooss (M\'ethodes d'Analyse, Stochastique des Codes et Traitements Num\'eriques), Olivier Asserin, (CEA-DEN), Alexandre Loredo (EA1859)

TL;DR
This paper introduces a new algorithm called constrained Latin hypercube sampling (cLHS) that generates samples respecting inequality constraints, improving sampling efficiency for complex numerical models with physical constraints.
Contribution
The paper presents a novel cLHS algorithm that incorporates inequality constraints into Latin hypercube sampling by permuting initial samples, demonstrated on a welding simulation example.
Findings
cLHS effectively enforces inequality constraints in sampling.
The method improves sampling accuracy in constrained physical models.
Application to welding simulation shows practical benefits.
Abstract
In some studies requiring predictive and CPU-time consuming numerical models, the sampling design of the model input variables has to be chosen with caution. For this purpose, Latin hypercube sampling has a long history and has shown its robustness capabilities. In this paper we propose and discuss a new algorithm to build a Latin hypercube sample (LHS) taking into account inequality constraints between the sampled variables. This technique, called constrained Latin hypercube sampling (cLHS), consists in doing permutations on an initial LHS to honor the desired monotonic constraints. The relevance of this approach is shown on a real example concerning the numerical welding simulation, where the inequality constraints are caused by the physical decreasing of some material properties in function of the temperature.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Multi-Objective Optimization Algorithms · Optimal Experimental Design Methods · Probabilistic and Robust Engineering Design
