CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Approximate Bayesian Computation by Subset Simulation using hierarchical state-space models

Majid Khorsand Vakilzadeh (Institutionen för tillämpad mekanik, Dynamik ; Svenskt VindkraftsTekniskt Centrum (SWPTC)) ; Y. Huang ; J. L. Beck ; Thomas Abrahamsson (Institutionen för tillämpad mekanik, Dynamik)
Mechanical Systems and Signal Processing (0888-3270). Vol. 84 (2017), p. 2-20.
[Artikel, refereegranskad vetenskaplig]

A new multi-level Markov Chain Monte Carlo algorithm for Approximate Bayesian Computation, ABC-SubSim, has recently appeared that exploits the Subset Simulation method for efficient rare-event simulation. ABC-SubSim adaptively creates a nested decreasing sequence of data-approximating regions in the output space that correspond to increasingly closer approximations of the observed output vector in this output space. At each level, multiple samples of the model parameter vector are generated by a component-wise Metropolis algorithm so that the predicted output corresponding to each parameter value falls in the current data-approximating region. Theoretically, if continued to the limit, the sequence of data-approximating regions would converge on to the observed output vector and the approximate posterior distributions, which are conditional on the data approximation region, would become exact, but this is not practically feasible. In this paper we study the performance of the ABC-SubSim algorithm for Bayesian updating of the parameters of dynamical systems using a general hierarchical state-space model. We note that the ABC methodology gives an approximate posterior distribution that actually corresponds to an exact posterior where a uniformly distributed combined measurement and modeling error is added. We also note that ABC algorithms have a problem with learning the uncertain error variances in a stochastic state-space model and so we treat them as nuisance parameters and analytically integrate them out of the posterior distribution. In addition, the statistical efficiency of the original ABC-SubSim algorithm is improved by developing a novel strategy to regulate the proposal variance for the component-wise Metropolis algorithm at each level. We demonstrate that Self-regulated ABC-SubSim is well suited for Bayesian system identification by first applying it successfully to model updating of a two degree-of-freedom linear structure for three cases: globally, locally and unidentifiable model classes, and then to model updating of a two degree-of-freedom nonlinear structure with Duffing nonlinearities in its interstory force-deflection relationship. (C) 2016 Elsevier Ltd. All rights reserved.

Nyckelord: Approximate Bayesian Computation, Subset Simulation, Self-regulating ABC-SubSim algorithm, Optimal, chain monte-carlo, parameter-estimation, failure probabilities, updating, models, high dimensions, selection, inference, systems, uncertainties, likelihoods, Engineering

Denna post skapades 2017-01-13. Senast ändrad 2017-02-27.
CPL Pubid: 246840


Läs direkt!

Länk till annan sajt (kan kräva inloggning)