Piecewise approximate Bayesian computation: fast inference for discretely observed Markov models using a factorised posterior distribution
From MaRDI portal
Publication:5962740
Abstract: Many modern statistical applications involve inference for complicated stochastic models for which the likelihood function is difficult or even impossible to calculate, and hence conventional likelihood-based inferential echniques cannot be used. In such settings, Bayesian inference can be performed using Approximate Bayesian Computation (ABC). However, in spite of many recent developments to ABC methodology, in many applications the computational cost of ABC necessitates the choice of summary statistics and tolerances that can potentially severely bias the estimate of the posterior. We propose a new "piecewise" ABC approach suitable for discretely observed Markov models that involves writing the posterior density of the parameters as a product of factors, each a function of only a subset of the data, and then using ABC within each factor. The approach has the advantage of side-stepping the need to choose a summary statistic and it enables a stringent tolerance to be set, making the posterior "less approximate". We investigate two methods for estimating the posterior density based on ABC samples for each of the factors: the first is to use a Gaussian approximation for each factor, and the second is to use a kernel density estimate. Both methods have their merits. The Gaussian approximation is simple, fast, and probably adequate for many applications. On the other hand, using instead a kernel density estimate has the benefit of consistently estimating the true ABC posterior as the number of ABC samples tends to infinity. We illustrate the piecewise ABC approach for three examples; in each case, the approach enables "exact matching" between simulations and data and offers fast and accurate inference.
Recommendations
- Constructing summary statistics for approximate Bayesian computation: semi-automatic approximate Bayesian computation. With discussion and authors' reply
- An adaptive sequential Monte Carlo method for approximate Bayesian computation
- Approximate Bayesian inference for discretely observed continuous‐time multi‐state models
- The rate of convergence for approximate Bayesian computation
- An Introduction to Approximate Bayesian Computation
Cites work
- scientific article; zbMATH DE number 3673370 (Why is no real title available?)
- scientific article; zbMATH DE number 1959513 (Why is no real title available?)
- scientific article; zbMATH DE number 4001209 (Why is no real title available?)
- scientific article; zbMATH DE number 847282 (Why is no real title available?)
- A model for the shapes of advected triangles
- A new test for multivariate normality
- A theory of the term structure of interest rates
- An adaptive sequential Monte Carlo method for approximate Bayesian computation
- Expectation propagation for likelihood-free inference
- FIRST-ORDER INTEGER-VALUED AUTOREGRESSIVE (INAR(1)) PROCESS
- MCMC for Integer-Valued ARMA processes
- Maximum Likelihood Estimation of Discretely Sampled Diffusions: A Closed-form Approximation Approach
- Optimal detection of changepoints with a linear computational cost
- Parameter estimation for hidden Markov models with intractable likelihoods
- Particle Markov Chain Monte Carlo Methods
- Stochastic modelling for systems biology.
- Stochastic processes in physics and chemistry.
Cited in
(15)- Forward simulation Markov chain Monte Carlo with applications to stochastic epidemic models
- Extending approximate Bayesian computation methods to high dimensions via a Gaussian copula model
- Rao-blackwellized sampling for batch and recursive Bayesian inference of piecewise affine models
- Alive SMC\(^{2}\): Bayesian model selection for low-count time series models with intractable likelihoods
- Approximate Bayesian Computation for a Class of Time Series Models
- Data free inference with processed data products
- An approximate likelihood perspective on ABC methods
- Likelihood free inference for Markov processes: a comparison
- Scalable Bayesian Nonparametric Clustering and Classification
- Consensus Monte Carlo for Random Subsets Using Shared Anchors
- Spectral density-based and measure-preserving ABC for partially observed diffusion processes. An illustration on Hamiltonian SDEs
- Likelihood-free approximate Gibbs sampling
- Accelerating inference for diffusions observed with measurement error and large sample sizes using approximate Bayesian computation
- Exact and approximate Bayesian inference for low integer-valued time series models with intractable likelihoods
- Diagnostics for assessing the linear noise and moment closure approximations
This page was built for publication: Piecewise approximate Bayesian computation: fast inference for discretely observed Markov models using a factorised posterior distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962740)
