9
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      A rare event approach to high dimensional Approximate Bayesian computation

      Preprint
      , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          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.

          Related collections

          Most cited references10

          • Record: found
          • Abstract: not found
          • Article: not found

          Approximate Bayesian computational methods

            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            The pseudo-marginal approach for efficient Monte Carlo computations

            We introduce a powerful and flexible MCMC algorithm for stochastic simulation. The method builds on a pseudo-marginal method originally introduced in [Genetics 164 (2003) 1139--1160], showing how algorithms which are approximations to an idealized marginal algorithm, can share the same marginal stationary distribution as the idealized method. Theoretical results are given describing the convergence properties of the proposed method, and simple numerical examples are given to illustrate the promising empirical characteristics of the technique. Interesting comparisons with a more obvious, but inexact, Monte Carlo approximation to the marginal algorithm, are also given.
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Population Monte Carlo

                Bookmark

                Author and article information

                Journal
                2016-11-08
                Article
                1611.02492
                30e8839c-d895-4648-a750-ba84600fa075

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                Supplementary material at end of pdf
                stat.CO

                Mathematical modeling & Computation
                Mathematical modeling & Computation

                Comments

                Comment on this article