Accelerate iterated filtering
Dao Nguyen

TL;DR
This paper introduces an accelerated version of iterated filtering for parameter estimation in partially observed Markov process models, achieving faster convergence and improved performance over previous methods.
Contribution
It presents a novel accelerated iterated filtering algorithm that enhances convergence rates and applies to both convex and non-convex likelihood functions.
Findings
Outperforms previous methods in toy examples
Achieves high convergence rate with relaxed conditions
Effective in modeling infectious diseases
Abstract
In simulation-based inferences for partially observed Markov process models (POMP), the by-product of the Monte Carlo filtering is an approximation of the log likelihood function. Recently, iterated filtering [14, 13] has originally been introduced and it has been shown that the gradient of the log likelihood can also be approximated. Consequently, different stochastic optimization algorithm can be applied to estimate the parameters of the underlying models. As accelerated gradient is an efficient approach in the optimization literature, we show that we can accelerate iterated filtering in the same manner and inherit that high convergence rate while relaxing the restricted conditions of unbiased gradient approximation. We show that this novel algorithm can be applied to both convex and non-convex log likelihood functions. In addition, this approach has substantially outperformed most of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Statistical Methods and Inference · Bayesian Methods and Mixture Models
