Accurate emulators for large-scale computer experiments
From MaRDI portal
Publication:449978
DOI10.1214/11-AOS929zbMath1246.65172arXiv1203.2433MaRDI QIDQ449978
Publication date: 3 September 2012
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.2433
interpolation; Gaussian process; radial basis function; reproducing kernel Hilbert space; emulation; large-scale problem; computer experiment; multi-step procedure; numerical technique
65M12: Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs
65G50: Roundoff error
41A17: Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities)
Related Items
Fast Prediction of Deterministic Functions Using Sparse Grid Experimental Designs, Predicting the Output From a Stochastic Computer Model When a Deterministic Approximation is Available, Maximum Likelihood Estimation for a Smooth Gaussian Random Field Model, A Theoretical Framework for Calibration in Computer Models: Parametrization, Estimation and Convergence Properties, Cross-Validation--based Adaptive Sampling for Gaussian Process Models, Practical Heteroscedastic Gaussian Process Modeling for Large Simulation Experiments, Multi-Resolution Functional ANOVA for Large-Scale, Many-Input Computer Experiments, On the construction of nested space-filling designs, Calibrating a large computer experiment simulating radiative shock hydrodynamics, Composite Gaussian process models for emulating expensive functions, Variable selection and sensitivity analysis using dynamic trees, with an application to computer code performance tuning, On the interface between nested designs and the multi-step interpolator, A new and flexible design construction for orthogonal arrays for modern applications, A Framework for Controlling Sources of Inaccuracy in Gaussian Process Emulation of Deterministic Computer Experiments, On the Instability Issue of Gradient-Enhanced Gaussian Process Emulators for Computer Experiments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiscale analysis in Sobolev spaces on bounded domains
- A multivariate central limit theorem for randomized orthogonal array sampling designs in computer experiments
- A new and flexible method for constructing designs for computer experiments
- Construction of nested space-filling designs
- Multistep approximation algorithms: Improved convergence rates through postconditioning with smoothing kernels
- Orthogonal arrays. Theory and applications
- Monte Carlo estimates of the log determinant of large sparse matrices
- Lattice sampling revisited: Monte Carlo variance of means over randomized orthogonal arrays
- On Latin hypercube sampling
- Scrambled net variance for integrals of smooth functions
- The design and analysis of computer experiments.
- On the asymptotic distribution of scrambled net quadrature.
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Error estimates for multilevel approximation using polyharmonic splines
- Multistep scattered data interpolation using compactly supported radial basis functions
- A combinatorial central limit theorem for randomized orthogonal array sampling designs
- Multilevel interpolation and approximation
- Compactly supported correlation functions
- An algorithm for selecting a good value for the parameter \(c\) in radial basis function interpolation
- Multiscale Analysis in Sobolev Spaces on the Sphere
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Orthogonal and nearly orthogonal designs for computer experiments
- Construction of orthogonal and nearly orthogonal Latin hypercubes
- Sliced space-filling designs
- Nested Latin hypercube designs
- Large Sample Properties of Simulations Using Latin Hypercube Sampling
- Orthogonal Array-Based Latin Hypercubes
- Monte Carlo Variance of Scrambled Net Quadrature
- Orthogonal Column Latin Hypercubes and Their Application in Computer Experiments
- Uniform Design: Theory and Application
- Approximating Likelihoods for Large Spatial Data Sets
- A theorem for selecting oa-based latin hypercubes using a distance criterion
- Nested Lattice Sampling: A New Sampling Scheme Derived by Randomizing Nested Orthogonal Arrays
- Covariance Tapering for Likelihood-Based Estimation in Large Spatial Data Sets
- A construction method for orthogonal Latin hypercube designs
- Theory of Reproducing Kernels
- Scattered Data Approximation
