Vernon, I. R. and Jackson, S. E. and Cumming, J. A. (2019) 'Known boundary emulation of complex computer models.', SIAM/ASA journal on uncertainty quantification., 7 (3). pp. 838-876.
Computer models are now widely used across a range of scientific disciplines to describe various complex physical systems, however to perform full uncertainty quantification we often need to employ emulators. An emulator is a fast statistical construct that mimics the complex computer model, and greatly aids the vastly more computationally intensive uncertainty quantification calculations that a serious scientific analysis often requires. In some cases, the complex model can be solved far more efficiently for certain parameter settings, leading to boundaries or hyperplanes in the input parameter space where the model is essentially known. We show that for a large class of Gaussian process style emulators, multiple boundaries can be formally incorporated into the emulation process, by Bayesian updating of the emulators with respect to the boundaries, for trivial computational cost. The resulting updated emulator equations are given analytically. This leads to emulators that possess increased accuracy across large portions of the input parameter space. We also describe how a user can incorporate such boundaries within standard black box GP emulation packages that are currently available, without altering the core code. Appropriate designs of model runs in the presence of known boundaries are then analysed, with two kinds of general purpose designs proposed. We then apply the improved emulation and design methodology to an important systems biology model of hormonal crosstalk in Arabidopsis Thaliana.
|Full text:||Publisher-imposed embargo |
(AM) Accepted Manuscript
File format - PDF (5951Kb)
|Full text:||(VoR) Version of Record|
Download PDF (5982Kb)
|Publisher Web site:||https://doi.org/10.1137/18M1164457|
|Publisher statement:||© 2019, Society for Industrial and Applied Mathematics.|
|Date accepted:||26 February 2019|
|Date deposited:||07 May 2019|
|Date of first online publication:||11 July 2019|
|Date first made open access:||31 July 2019|
Save or Share this output
|Look up in GoogleScholar|