arXiv:2610.38753 · v1
Metropolized backward sampling for conditional sequential Monte Carlo
摘要
Particle Gibbs samplers with backward sampling are widely used for sampling the smoothing distribution of state-space models, but, with few particles, the new trajectory often coincides with the current one at many time steps. A known but rarely used remedy replaces the random selection of the final particle by a Metropolis--Hastings move which avoids the current particle. We show that, with backward sampling, this remedy only helps at the last time steps, because its effect on the update rates decays geometrically with the distance to the final time. We propose instead Metropolized backward sampling, which makes such a move at every step of the backward pass, forcibly switching trajectories whenever possible. Additionally, we introduce a coupled version which prevents proposing the current trajectory, maximizing the chances of an actual switch versus the current trajectory and performing perfect sampling when the state-space model has no observations, a feature not shared by backward sampling. We prove that, at every time step, both methods dominate backward sampling as they update the state more often and have smaller lag-one autocorrelations than it does. Our methods are drop-in replacements for backward sampling, and can be used to improve any particle Gibbs sampler.
作者备注：12 pages + appendix. A Lean formalization was AI-generated after the draft of the paper was written as an experiment. I have subsequently edited the documentation of the formalization for better readability, and discussed the process, as well as difference between the AI-formalized and my original proofs in the appendix. https://adriencorenflos.github.io/formalization/metropolized-CSMC/