New Insights into History Matching via Sequential Monte Carlo

by   Christopher C Drovandi, et al.

The aim of the history matching method is to locate non-implausible regions of the parameter space of complex deterministic or stochastic models by matching model outputs with data. It does this via a series of waves where at each wave an emulator is fitted to a small number of training samples. An implausibility measure is defined which takes into account the closeness of simulated and observed outputs as well as emulator uncertainty. As the waves progress, the emulator becomes more accurate so that training samples are more concentrated on promising regions of the space and poorer parts of the space are rejected with more confidence. Whilst history matching has proved to be useful, existing implementations are not fully automated and some ad-hoc choices are made during the process, which involves user intervention and is time consuming. This occurs especially when the non-implausible region becomes small and it is difficult to sample this space uniformly to generate new training points. In this article we develop a sequential Monte Carlo (SMC) algorithm for implementation which is semi-automated. Our novel SMC approach reveals that the history matching method yields a non-implausible distribution that can be multi-modal, highly irregular and very difficult to sample uniformly. Our SMC approach offers a much more reliable sampling of the non-implausible space, which requires additional computation compared to other approaches used in the literature.


page 19

page 20


Emulation and History Matching using the hmer Package

Modelling complex real-world situations such as infectious diseases, geo...

Unbiased and Consistent Nested Sampling via Sequential Monte Carlo

We introduce a new class of sequential Monte Carlo methods called Nested...

Chebyshev Particles

Markov chain Monte Carlo (MCMC) provides a feasible method for inferring...

Deterministic Gibbs Sampling via Ordinary Differential Equations

Deterministic dynamics is an essential part of many MCMC algorithms, e.g...

Higher-order Quasi-Monte Carlo Training of Deep Neural Networks

We present a novel algorithmic approach and an error analysis leveraging...

Inference Trees: Adaptive Inference with Exploration

We introduce inference trees (ITs), a new class of inference methods tha...

Performance Analysis of Robust Stable PID Controllers Using Dominant Pole Placement for SOPTD Process Models

This paper derives new formulations for designing dominant pole placemen...

Please sign up or login with your details

Forgot password? Click here to reset