Computer Experiments: Prediction Accuracy, Sample Size and Model Complexity Revisited
From MaRDI portal
Recommendations
- Estimating prediction error for complex samples
- Sample size considerations and augmentation of computer experiments
- Computer experiment designs for accurate prediction
- Evaluation and selection of models for out-of-sample prediction when the sample size is small relative to the complexity of the data-generating process
- Prediction for computer experiments with both quantitative and qualitative factors
- Complexity in the case against accuracy estimation
- Prediction in \(\mathcal M\)-complete problems with limited sample size
Cited in
(10)- Sample size considerations and augmentation of computer experiments
- Analysis-of-Marginal-Tail-Means (ATM): A Robust Method for Discrete Black-Box Optimization
- Kriging: methods and applications
- Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences
- Cross-validation-based adaptive sampling for Gaussian process models
- On Matérn covariance and Gaussian Markov random fields: a spectral analysis
- Hierarchical shrinkage Gaussian processes: applications to computer code emulation and dynamical system recovery
- Solving an inverse problem for time-series-valued computer simulators via multiple contour estimation
- APIK: Active Physics-Informed Kriging Model with Partial Differential Equations
- Computer model calibration based on image warping metrics: an application for sea ice deformation
This page was built for publication: Computer Experiments: Prediction Accuracy, Sample Size and Model Complexity Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639584)
