Robust, partially alive particle Metropolis-Hastings via the Frankenfilter

2026-01-30

AI Summary

This work addresses the failure of conventional particle filters in hidden Markov models when observation likelihoods are zero, a scenario that complicates parameter estimation and incurs high computational costs. The authors propose the Frankenfilter method, which constructs a partially activated particle filter by fixing upper and lower bounds on simulated particles while targeting a user-specified number of successful likelihood evaluations. This approach yields unbiased likelihood estimates suitable for embedding within a pseudo-marginal Metropolis–Hastings algorithm. Notably, Frankenfilter is the first to integrate a controllable success target with explicit computational constraints, substantially enhancing both robustness and efficiency: it remains stable under outliers or poor initialization, achieves 2–3× computational speedup, and provides clear guidance for setting the success target—e.g., equal to the number of exact observations \(n\) in precise observation settings.

Technology Category

• Reasoning under Uncertainty: Relational Probabilistic Models
• Machine Learning: Probabilistic Circuits and Graphical Models
• Intelligent Robots: State Estimation

Application Category

• Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphs
• User Modeling, Personalization and Recommendation: Metrics for user behavior and evaluating success
• Search and Retrieval-Augmented AI: Web evaluation methodologies and metrics

Abstract

When a hidden Markov model permits the conditional likelihood of an observation given the hidden process to be zero, all particle simulations from one observation time to the next could produce zeros. If so, the filtering distribution cannot be estimated and the estimated parameter likelihood is zero. The alive particle filter addresses this by simulating a random number of particles for each inter-observation interval, stopping after a target number of non-zero conditional likelihoods. For outlying observations or poor parameter values, a non-zero result can be extremely unlikely, and computational costs prohibitive. We introduce the Frankenfilter, a principled, partially alive particle filter that targets a user-defined amount of success whilst fixing lower and upper bounds on the number of simulations. The Frankenfilter produces unbiased estimators of the likelihood, suitable for pseudo-marginal Metropolis--Hastings (PMMH). We demonstrate that PMMH with the Frankenfilter is more robust to outliers and mis-specified initial parameter values than PMMH using standard particle filters, and is typically at least 2-3 times more efficient. We also provide advice for choosing the amount of success. In the case of n exact observations, this is particularly simple: target n successes.

Problem

• hidden Markov model
• particle filter
• zero likelihood
• outlier robustness
• computational cost

Innovation

• Frankenfilter
• alive particle filter
• pseudo-marginal MCMC
• robust particle filtering
• unbiased likelihood estimation