Optimized and regularly repeated lattice-based Latin hypercube designs for large-scale computer experiments
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910989037862912 |
|---|---|
| author | He, Xu Gong, Junpeng Li, Zhaohui |
| author_facet | He, Xu Gong, Junpeng Li, Zhaohui |
| contents | Computer simulations serve as powerful tools for scientists and engineers to gain insights into complex systems. Less costly than physical experiments, computer experiments sometimes involve large number of trials. Conventional design optimization and model fitting methods for computer experiments are inefficient for large-scale problems. In this paper, we propose new methods to optimize good lattice point sets, using less computation to construct designs with enhanced space-filling properties such as high separation distance, low discrepancy, and high separation distance on projections. These designs show promising performance in uncertainty quantification as well as physics-informed neural networks. We also propose a new type of space-filling design called regularly repeated lattice-based Latin hypercube designs, which contain lots of local space-filling Latin hypercube designs as subdesigns. Such designs facilitate rapid fitting of multiple local Gaussian process models in a moving window type of modeling approach and thus are useful for large-scale emulation problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_04582 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Optimized and regularly repeated lattice-based Latin hypercube designs for large-scale computer experiments He, Xu Gong, Junpeng Li, Zhaohui Methodology 62K05 Computer simulations serve as powerful tools for scientists and engineers to gain insights into complex systems. Less costly than physical experiments, computer experiments sometimes involve large number of trials. Conventional design optimization and model fitting methods for computer experiments are inefficient for large-scale problems. In this paper, we propose new methods to optimize good lattice point sets, using less computation to construct designs with enhanced space-filling properties such as high separation distance, low discrepancy, and high separation distance on projections. These designs show promising performance in uncertainty quantification as well as physics-informed neural networks. We also propose a new type of space-filling design called regularly repeated lattice-based Latin hypercube designs, which contain lots of local space-filling Latin hypercube designs as subdesigns. Such designs facilitate rapid fitting of multiple local Gaussian process models in a moving window type of modeling approach and thus are useful for large-scale emulation problems. |
| title | Optimized and regularly repeated lattice-based Latin hypercube designs for large-scale computer experiments |
| topic | Methodology 62K05 |
| url | https://arxiv.org/abs/2506.04582 |