Fast Parallel Kriging-Based Stepwise Uncertainty Reduction With Application to the Identification of an Excursion Set

Stepwise uncertainty reduction (SUR) strategies aim at constructing a sequence of points for evaluating a function  f in such a way that the residual uncertainty about a quantity of interest progressively decreases to zero. Using such strategies in the framework of Gaussian process modeling has been shown to be efficient for estimating the volume of excursion of f above a fixed threshold. However, SUR strategies remain cumbersome to use in practice because of their high computational complexity, and the fact that they deliver a single point at each iteration. In this article we introduce several multipoint sampling criteria, allowing the selection of batches of points at which f can be evaluated in parallel. Such criteria are of particular interest when f is costly to evaluate and several CPUs are simultaneously available. We also manage to drastically reduce the computational cost of these strategies through the use of closed form formulas. We illustrate their performances in various numerical experiments, including a nuclear safety test case. Basic notions about kriging, auxiliary problems, complexity calculations, R code, and data are available online as supplementary materials.

[1]  D. Ginsbourger,et al.  Towards Gaussian Process-based Optimization with Finite Time Horizon , 2010 .

[2]  Julien Bect,et al.  A sequential Bayesian algorithm to estimate a probability of failure , 2009 .

[3]  Victor Picheny,et al.  Adaptive Designs of Experiments for Accurate Approximation of a Target Region , 2010 .

[4]  A. Genz.  Numerical Computation of Multivariate Normal Probabilities , 1992 .

[5]  Andy J. Keane,et al.  Engineering Design via Surrogate Modelling - A Practical Guide , 2008 .

[6]  T. J. Mitchell,et al.  Exploratory designs for computational experiments , 1995 .

[7]  Ling Li,et al.  Sequential design of computer experiments for the estimation of a probability of failure , 2010, Statistics and Computing.

[8]  Emmanuel Vazquez,et al.  Estimation du volume des ensembles d'excursion d'un processus Gaussien par Krigeage intrinsèque , 2007 .

[9]  Christian P. Robert,et al.  Monte Carlo Statistical Methods , 2005, Springer Texts in Statistics.

[10]  Randal J. Barnes,et al.  Efficient updating of kriging estimates and variances , 1992 .

[11]  George Michailidis,et al.  Sequential Experiment Design for Contour Estimation From Complex Computer Codes , 2008, Technometrics.

[12]  Isaac Siwale.  ON GLOBAL OPTIMIZATION , 2015 .

[13]  David Ginsbourger,et al.  Corrected Kriging Update Formulae for Batch-Sequential Data Assimilation , 2012, 1203.6452.

[14]  X. Emery.  The kriging update equations and their application to the selection of neighboring data , 2009 .

[15]  M. Eldred,et al.  Efficient Global Reliability Analysis for Nonlinear Implicit Performance Functions , 2008 .

[16]  Donald R. Jones,et al.  Efficient Global Optimization of Expensive Black-Box Functions , 1998, J. Glob. Optim..

[17]  Sonja Kuhnt,et al.  Design and analysis of computer experiments , 2010 .

[18]  Julien Bect,et al.  Robust Gaussian Process-Based Global Optimization Using a Fully Bayesian Expected Improvement Criterion , 2011, LION.

[19]  Anne Auger,et al.  Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions , 2009 .

[20]  Vincent Dubourg.  Méta-modèles adaptatifs pour l'analyse de fiabilité et l'optimisation sous contrainte fiabiliste , 2011 .

[21]  James O. Berger,et al.  A Framework for Validation of Computer Models , 2007, Technometrics.

[22]  D. Ginsbourger,et al.  Kriging is well-suited to parallelize optimization , 2010 .

[23]  Runze Li,et al.  Design and Modeling for Computer Experiments , 2005 .

[24]  Victor Picheny,et al.  KrigInv: An efficient and user-friendly implementation of batch-sequential inversion strategies based on kriging , 2014, Comput. Stat. Data Anal..

[25]  Gene H. Golub,et al.  Matrix computations , 1983 .

[26]  Robert B. Gramacy,et al.  Adaptive Design and Analysis of Supercomputer Experiments , 2008, Technometrics.

[27]  Alyson G. Wilson,et al.  Finding Near-Optimal Bayesian Experimental Designs via Genetic Algorithms , 2001 .

[28]  R JonesDonald,et al.  Efficient Global Optimization of Expensive Black-Box Functions , 1998 .

[29]  Jerome Sacks,et al.  Designs for Computer Experiments , 1989 .

[30]  Robert B. Gramacy,et al.  Optimization Under Unknown Constraints , 2010, 1004.4027.

[31]  Dirk P. Kroese,et al.  Simulation and the Monte Carlo method , 1981, Wiley series in probability and mathematical statistics.

[32]  Ling Li,et al.  Bayesian Subset Simulation: a kriging-based subset simulation algorithm for the estimation of small probabilities of failure , 2012, 1207.1963.

[33]  Yves Deville,et al.  DiceKriging, DiceOptim: Two R Packages for the Analysis of Computer Experiments by Kriging-Based Metamodeling and Optimization , 2012 .

[34]  Haiyu Gao,et al.  The updated kriging variance and optimal sample design , 1996 .

[35]  David Ginsbourger,et al.  Fast Computation of the Multi-Points Expected Improvement with Applications in Batch Selection , 2013, LION.

[36]  Robert B. Gramacy,et al.  Particle Learning of Gaussian Process Models for Sequential Design and Optimization , 2009, 0909.5262.

[37]  Aimo A. Törn,et al.  Global Optimization , 1999, Science.