Fast prediction of deterministic functions using sparse grid experimental designs
From MaRDI portal
Abstract: Random field models have been widely employed to develop a predictor of an expensive function based on observations from an experiment. The traditional framework for developing a predictor with random field models can fail due to the computational burden it requires. This problem is often seen in cases where the input of the expensive function is high dimensional. While many previous works have focused on developing an approximative predictor to resolve these issues, this article investigates a different solution mechanism. We demonstrate that when a general set of designs is employed, the resulting predictor is quick to compute and has reasonable accuracy. The fast computation of the predictor is made possible through an algorithm proposed by this work. This paper also demonstrates methods to quickly evaluate the likelihood of the observations and describes some fast maximum likelihood estimates for unknown parameters of the random field. The computational savings can be several orders of magnitude when the input is located in a high dimensional space. Beyond the fast computation of the predictor, existing research has demonstrated that a subset of these designs generate predictors that are asymptotically efficient. This work details some empirical comparisons to the more common space-filling designs that verify the designs are competitive in terms of resulting prediction accuracy.
Recommendations
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Computer experiment designs for accurate prediction
- Design and analysis of computer experiments when the output is highly correlated over the input space
- Bayesian Design and Analysis of Computer Experiments: Use of Derivatives in Surface Prediction
- scientific article; zbMATH DE number 788265
Cites work
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- Accurate emulators for large-scale computer experiments
- APPROXIMATE RECOVERY OF PERIODIC FUNCTIONS OF SEVERAL VARIABLES
- Average case complexity of linear multivariate problems. I: Theory
- Bayes-Hermite quadrature
- Bayesian calibration of computer models. (With discussion)
- Bayesian treed Gaussian process models with an application to computer modeling
- Computer Model Calibration Using High-Dimensional Output
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Explicit cost bounds of algorithms for multivariate tensor product problems
- Exploratory designs for computational experiments
- Fixed Rank Kriging for Very Large Spatial Data Sets
- Gaussian Predictive Process Models for Large Spatial Data Sets
- High dimensional polynomial interpolation on sparse grids
- High-Order Collocation Methods for Differential Equations with Random Inputs
- Multivariate integration and approximation for random fields satisfying Sacks-Ylvisaker conditions
- Numerical methods for stochastic computations. A spectral method approach.
- On the \(L_2\)-discrepancy for anchored boxes
- Scattered Data Approximation
Cited in
(12)- A Bayesian optimization approach to find Nash equilibria
- Practical Heteroscedastic Gaussian Process Modeling for Large Simulation Experiments
- Multiresolution functional ANOVA for large-scale, many-input computer experiments
- Emulating dynamic non-linear simulators using Gaussian processes
- On the instability issue of gradient-enhanced Gaussian process emulators for computer experiments
- Adaptive Design and Analysis Via Partitioning Trees for Emulation of a Complex Computer Code
- Scaled Vecchia approximation for fast computer-model emulation
- scientific article; zbMATH DE number 7329270 (Why is no real title available?)
- Sparse polynomial prediction
- A Clustered Gaussian Process Model for Computer Experiments
- Data assimilation: from mathematical and statistical foundations to applications. Abstracts from the workshop held February 23--28, 2025
- Lengthscale-informed sparse grids for kernel methods in high dimensions
This page was built for publication: Fast prediction of deterministic functions using sparse grid experimental designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975627)
