Automatically adapting the number of state particles in SMC^2
From MaRDI portal
Publication:6173563
Abstract: Sequential Monte Carlo squared (SMC) methods can be used for parameter inference of intractable likelihood state-space models. These methods replace the likelihood with an unbiased particle filter estimator, similarly to particle Markov chain Monte Carlo (MCMC). As with particle MCMC, the efficiency of SMC greatly depends on the variance of the likelihood estimator, and therefore on the number of state particles used within the particle filter. We introduce novel methods to adaptively select the number of state particles within SMC using the expected squared jumping distance to trigger the adaptation, and modifying the exchange importance sampling method of citet{Chopin2012a} to replace the current set of state particles with the new set of state particles. The resulting algorithm is fully automatic, and can significantly improve current methods. Code for our methods is available at https://github.com/imkebotha/adaptive-exact-approximate-smc.
Recommendations
- \(\mathrm{SMC}^2\): an efficient algorithm for sequential analysis of state space models
- An adaptive sequential Monte Carlo sampler
- Efficient \(\mathrm{SMC}^2\) schemes for stochastic kinetic models
- Sequential Monte Carlo with Highly Informative Observations
- Adaptive particle allocation in iterated sequential Monte Carlo via approximating meta-models
Cites work
- scientific article; zbMATH DE number 2106098 (Why is no real title available?)
- A comparison of inferential methods for highly nonlinear state space models in ecology and epidemiology
- A sequential particle filter method for static models
- Accelerating sequential Monte Carlo with surrogate likelihoods
- Adapting the Number of Particles in Sequential Monte Carlo Methods Through an Online Scheme for Convergence Assessment
- Adaptive particle allocation in iterated sequential Monte Carlo via approximating meta-models
- Adaptively scaling the Metropolis algorithm using expected squared jumped distance
- An adaptive sequential Monte Carlo sampler
- Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator
- Ensemble MCMC: accelerating pseudo-marginal MCMC for state space models using the ensemble Kalman filter
- Inference for Lévy-driven stochastic volatility models via adaptive sequential Monte Carlo
- Inference in hidden Markov models.
- Nested particle filters for online parameter estimation in discrete-time state-space Markov models
- On some properties of Markov chain Monte Carlo simulation methods based on the particle filter
- On the efficiency of pseudo-marginal random walk Metropolis algorithms
- On the performance of particle filters with adaptive number of particles
- Particle Markov Chain Monte Carlo Methods
- Particle methods for stochastic differential equation mixed effects models
- Path storage in the particle filter
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
- Sequential Monte Carlo Samplers
- Stochastic differential equations. An introduction with applications.
- The pseudo-marginal approach for efficient Monte Carlo computations
- Uniform convergence over time of a nested particle filtering scheme for recursive parameter estimation in state-space Markov models
- Variance estimation in the particle filter
- \(\mathrm{SMC}^2\): an efficient algorithm for sequential analysis of state space models
Cited in
(2)
This page was built for publication: Automatically adapting the number of state particles in \(\text{SMC}^2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173563)
