Poisson approximate likelihood compared to the particle filter
Yize Hao, Aaron A. Abkemeier, Edward L. Ionides

TL;DR
This paper critically examines the Poisson approximate likelihood (PAL) filter, revealing that its purported advantages over particle filters are invalid when applied to the same data, and showing particle filters perform better in correct model settings.
Contribution
The paper identifies flaws in previous comparisons between PAL and particle filters, demonstrating that PAL's advantages are due to data scaling issues and not inherent superiority.
Findings
PAL's claimed advantages are invalid when applied to the same data.
Particle filters outperform PAL in correctly specified models.
Scaling differences explain previous performance claims.
Abstract
Filtering algorithms are fundamental for inference on partially observed stochastic dynamic systems, since they provide access to the likelihood function and hence enable likelihood-based or Bayesian inference. A novel Poisson approximate likelihood (PAL) filter was introduced by Whitehouse et al. (2023). PAL employs a Poisson approximation to conditional densities, offering a fast approximation to the likelihood function for a certain subset of partially observed Markov process models. A central piece of evidence for PAL is the comparison in Table 1 of Whitehouse et al. (2023), which claims a large improvement for PAL over a standard particle filter algorithm. This evidence, based on a model and data from a previous scientific study by Stocks et al. (2020), might suggest that researchers confronted with similar models should use PAL rather than particle filter methods. Taken at face…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWater Systems and Optimization
