Abstract

Approximate Bayesian computation (ABC) methods permit approximate inference for intractable likelihoods when it is possible to simulate from the model. However, they perform poorly for high-dimensional data and in practice must usually be used in conjunction with dimension reduction methods, resulting in a loss of accuracy which is hard to quantify or control. We propose a new ABC method for high-dimensional data based on rare event methods which we refer to as RE-ABC. This uses a latent variable representation of the model. For a given parameter value, we estimate the probability of the rare event that the latent variables correspond to data roughly consistent with the observations. This is performed using sequential Monte Carlo and slice sampling to systematically search the space of latent variables. In contrast, standard ABC can be viewed as using a more naive Monte Carlo estimate. We use our rare event probability estimator as a likelihood estimate within the pseudo-marginal Metropolis–Hastings algorithm for parameter inference. We provide asymptotics showing that RE-ABC has a lower computational cost for high-dimensional data than standard ABC methods. We also illustrate our approach empirically, on a Gaussian distribution and an application in infectious disease modelling.

Highlights

  • Approximate Bayesian computation (ABC) is a family of methods for approximate inference, used when likelihoods are impossible or impractical to evaluate numerically but simulating datasets from the model of interest is straightforward

  • We propose a method to deal with this issue and permit higher-dimensional data or summary statistics to be used in ABC

  • We have presented a method for approximate inference under an intractable likelihood when simulation of data is possible

Read more

Summary

Introduction

Approximate Bayesian computation (ABC) is a family of methods for approximate inference, used when likelihoods are impossible or impractical to evaluate numerically but simulating datasets from the model of interest is straightforward. For a particular θ value, to use rare event methods to estimate the probability of x values occurring which produce y(θ, x) ≈ yobs. Stat Comput θ used in existing ABC algorithms We estimate this probability using SMC algorithms for rare events from Cérou et al (2012). Given θ , standard ABC methods effectively simulate one or several x values from their prior and calculate a Monte Carlo estimate of Pr(y(θ, x) ≈ yobs). This relative error of this estimate has high variance when the probability is small, as is the case when we require close matches.

Related literature
Contributions and overview
Approximate Bayesian computation
Rare event sequential Monte Carlo
Slice sampling
Likelihood estimation
High-dimensional ABC
Inference
Validity of assumptions
Epidemic application
Distance function
Analysis of Abakaliki data
Discussion
Latent variable considerations count
Adaptive and non-adaptive algorithms
RE-ABC
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call