Adaptive Design and Analysis Via Partitioning Trees for Emulation of a Complex Computer Code

DOI10.1080/10618600.2022.2039160OpenAlexW4213095490MaRDI QIDQ5057264

William J. Welch, Sonja Isberg

Publication date: 16 December 2022

Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10618600.2022.2039160

zbMATH Keywords

recursive partitioningactive learningcomputer experimentsurrogateGaussian stochastic processsequential designlarge-scale experiment

Mathematics Subject Classification ID

Statistics (62-XX)

Uses Software

• Unnamed Item
• Unnamed Item
• EGO
• tgp
• laGP
• MaxPro
• Virtual library

Cites Work

• Unnamed Item
• Efficient emulators of computer experiments using compactly supported correlation functions, with an application to cosmology
• Efficient global optimization of expensive black-box functions
• Design and analysis of computer experiments. With comments and a rejoinder by the authors
• Bayesian learning for neural networks
• High dimensional polynomial interpolation on sparse grids
• Bayesian Treed Gaussian Process Models With an Application to Computer Modeling
• Posterior consistency for Gaussian process approximations of Bayesian posterior distributions
• Approximating Likelihoods for Large Spatial Data Sets
• Fast Prediction of Deterministic Functions Using Sparse Grid Experimental Designs
• Composite grid designs for adaptive computer experiments with fast inference
• Adaptive Gaussian Process Approximation for Bayesian Inference with Expensive Likelihood Functions
• Maximum projection designs for computer experiments
• Multivariate Density Estimation by Bayesian Sequential Partitioning

This page was built for publication: Adaptive Design and Analysis Via Partitioning Trees for Emulation of a Complex Computer Code