Latin Hypercubes and Space-filling Designs
C. Devon Lin, Boxin Tang

TL;DR
This chapter explores the use of Latin hypercube and other space-filling designs to optimize the distribution of points in computer experiments, aiming for uniform coverage of the design space.
Contribution
It provides a general approach to creating space-filling designs, emphasizing Latin hypercubes for efficient and uniform sampling in computer experiments.
Findings
Latin hypercubes effectively fill the design space uniformly.
Space-filling designs improve the accuracy of computer experiments.
The chapter offers methods for constructing such designs.
Abstract
This chapter discusses a general design approach to planning computer experiments, which seeks design points that fill a bounded design region as uniformly as possible. Such designs are broadly referred to as space-filling designs.
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
TopicsEvolutionary Algorithms and Applications · DNA and Biological Computing · VLSI and FPGA Design Techniques
