Approximate Bayesian Computation by Subset Simulation for Parameter Inference of Dynamical Models
Paper in proceedings, 2016
A new multi-level Markov chain Monte Carlo algorithm for Bayesian inference, ABC-SubSim, has recently appeared that combines the principles of Approximate Bayesian Computation (ABC) with the method of subset simulation for efficient rare-event simulation. ABC-SubSim adaptively creates a nested decreasing sequence of data-approximating regions in the output space. This sequence corresponds to increasingly closer approximations of the observed output vector in this output space. At each stage, the approximate likelihood function at a given value of the model parameter vector is defined as the probability that the predicted output corresponding to that parameter value falls in the current data-approximating region. If continued to the limit, the sequence of the data-approximating regions would converge on to the observed output vector and the approximate likelihood function would become exact, but this is not computationally feasible. At the heart of this paper is the interpretation of the resulting approximate likelihood function. We show that under the assumption of the existence of uniformly-distributed measurement errors, ABC gives exact Bayesian inference. Moreover, we present a new optimal proposal variance scaling strategy which enables ABC-SubSim to efficiently explore the posterior PDF. The algorithm is applied to the model updating of a two degree-of-freedom linear structure to illustrate its ability to handle model classes with various degrees of identifiability.
Adaptive modified Metropolis algorithm
Approximate Bayesian computation
Optimal proposal variance scaling