Adaptive particle allocation in iterated sequential Monte Carlo via approximating meta-models
From MaRDI portal
Publication:2631374
Recommendations
Cites work
- scientific article; zbMATH DE number 1666089 (Why is no real title available?)
- A lognormal central limit theorem for particle approximations of normalizing constants
- A review of recent advances in global optimization
- Asymptotic Statistics
- Blind Deconvolution via Sequential Imputations
- Filtering via Simulation: Auxiliary Particle Filters
- Inference in hidden Markov models.
- Iterated filtering
- Malaria in Northwest India: data analysis via partially observed stochastic differential equation models driven by Lévy noise
- Monte Carlo strategies in scientific computing
- Numerical Optimization
- On adaptive resampling strategies for sequential Monte Carlo methods
- Particle Markov Chain Monte Carlo Methods
- Twisted particle filters
Cited in
(8)- On the performance of particle filters with adaptive number of particles
- Alive SMC\(^{2}\): Bayesian model selection for low-count time series models with intractable likelihoods
- Adapting the Number of Particles in Sequential Monte Carlo Methods Through an Online Scheme for Convergence Assessment
- Twisting the alive particle filter
- Machine learning meta-models for fast parameter identification of the lattice discrete particle model
- Automatically adapting the number of state particles in \(\text{SMC}^2\)
- An algorithm for approximating the second moment of the normalizing constant estimate from a particle filter
- Adaptive Component-Wise Multiple-Try Metropolis Sampling
This page was built for publication: Adaptive particle allocation in iterated sequential Monte Carlo via approximating meta-models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631374)