Efficient SMC2 schemes for stochastic kinetic models

Fitting stochastic kinetic models represented by Markov jump processes within the Bayesian paradigm is complicated by the intractability of the observed-data likelihood. There has therefore been considerable attention given to the design of pseudo-marginal Markov chain Monte Carlo algorithms for suc...

Full description

Bibliographic Details
Main Authors: Golightly, Andrew, Kypraios, Theodore
Format: Article
Published: Springer 2017
Subjects:
Online Access:https://eprints.nottingham.ac.uk/48416/
_version_ 1848797758074388480
author Golightly, Andrew
Kypraios, Theodore
author_facet Golightly, Andrew
Kypraios, Theodore
author_sort Golightly, Andrew
building Nottingham Research Data Repository
collection Online Access
description Fitting stochastic kinetic models represented by Markov jump processes within the Bayesian paradigm is complicated by the intractability of the observed-data likelihood. There has therefore been considerable attention given to the design of pseudo-marginal Markov chain Monte Carlo algorithms for such models. However, these methods are typically computationally intensive, often require careful tuning and must be restarted from scratch upon receipt of new observations. Sequential Monte Carlo (SMC) methods on the other hand aim to efficiently reuse posterior samples at each time point. Despite their appeal, applying SMC schemes in scenarios with both dynamic states and static parameters is made difficult by the problem of particle degeneracy. A principled approach for overcoming this problem is to move each parameter particle through a Metropolis-Hastings kernel that leaves the target invariant. This rejuvenation step is key to a recently proposed SMC2 algorithm, which can be seen as the pseudo-marginal analogue of an idealised scheme known as iterated batch importance sampling. Computing the parameter weights in SMC2 requires running a particle filter over dynamic states to unbiasedly estimate the intractable observed-data likelihood up to the current time point. In this paper, we propose to use an auxiliary particle filter inside the SMC2 scheme. Our method uses two recently proposed constructs for sampling conditioned jump processes, and we find that the resulting inference schemes typically require fewer state particles than when using a simple bootstrap filter. Using two applications, we compare the performance of the proposed approach with various competing methods, including two global MCMC schemes.
first_indexed 2025-11-14T20:08:58Z
format Article
id nottingham-48416
institution University of Nottingham Malaysia Campus
institution_category Local University
last_indexed 2025-11-14T20:08:58Z
publishDate 2017
publisher Springer
recordtype eprints
repository_type Digital Repository
spelling nottingham-484162020-05-04T19:16:53Z https://eprints.nottingham.ac.uk/48416/ Efficient SMC2 schemes for stochastic kinetic models Golightly, Andrew Kypraios, Theodore Fitting stochastic kinetic models represented by Markov jump processes within the Bayesian paradigm is complicated by the intractability of the observed-data likelihood. There has therefore been considerable attention given to the design of pseudo-marginal Markov chain Monte Carlo algorithms for such models. However, these methods are typically computationally intensive, often require careful tuning and must be restarted from scratch upon receipt of new observations. Sequential Monte Carlo (SMC) methods on the other hand aim to efficiently reuse posterior samples at each time point. Despite their appeal, applying SMC schemes in scenarios with both dynamic states and static parameters is made difficult by the problem of particle degeneracy. A principled approach for overcoming this problem is to move each parameter particle through a Metropolis-Hastings kernel that leaves the target invariant. This rejuvenation step is key to a recently proposed SMC2 algorithm, which can be seen as the pseudo-marginal analogue of an idealised scheme known as iterated batch importance sampling. Computing the parameter weights in SMC2 requires running a particle filter over dynamic states to unbiasedly estimate the intractable observed-data likelihood up to the current time point. In this paper, we propose to use an auxiliary particle filter inside the SMC2 scheme. Our method uses two recently proposed constructs for sampling conditioned jump processes, and we find that the resulting inference schemes typically require fewer state particles than when using a simple bootstrap filter. Using two applications, we compare the performance of the proposed approach with various competing methods, including two global MCMC schemes. Springer 2017-11-10 Article PeerReviewed Golightly, Andrew and Kypraios, Theodore (2017) Efficient SMC2 schemes for stochastic kinetic models. Statistics and Computing . ISSN 1573-1375 Auxiliary particle filter (APF); Bayesian inference; Markov jump process (MJP); Sequential Monte Carlo (SMC); Stochastic kinetic model (SKM) https://doi.org/10.1007/s11222-017-9789-8 doi:10.1007/s11222-017-9789-8 doi:10.1007/s11222-017-9789-8
spellingShingle Auxiliary particle filter (APF); Bayesian inference; Markov jump process (MJP); Sequential Monte Carlo (SMC); Stochastic kinetic model (SKM)
Golightly, Andrew
Kypraios, Theodore
Efficient SMC2 schemes for stochastic kinetic models
title Efficient SMC2 schemes for stochastic kinetic models
title_full Efficient SMC2 schemes for stochastic kinetic models
title_fullStr Efficient SMC2 schemes for stochastic kinetic models
title_full_unstemmed Efficient SMC2 schemes for stochastic kinetic models
title_short Efficient SMC2 schemes for stochastic kinetic models
title_sort efficient smc2 schemes for stochastic kinetic models
topic Auxiliary particle filter (APF); Bayesian inference; Markov jump process (MJP); Sequential Monte Carlo (SMC); Stochastic kinetic model (SKM)
url https://eprints.nottingham.ac.uk/48416/
https://eprints.nottingham.ac.uk/48416/
https://eprints.nottingham.ac.uk/48416/