Mixing time of the conditional backward sampling particle filter
arxiv(2023)
摘要
The conditional backward sampling particle filter (CBPF) is a powerful Markov
chain Monte Carlo algorithm for general state space hidden Markov model
smoothing. We show that, under a general (strong mixing) condition, its mixing
time is upper bounded by O(log T) where T is the time horizon. The result
holds for a fixed number of particles N which is sufficiently large
(depending on the strong mixing constants), and therefore guarantees an overall
computational complexity of O(Tlog T) f or general hidden Markov model
smoothing. We provide an example which shows that the mixing time O(log T)
is optimal. Our proof relies on analysis of a novel coupling of two CBPFs,
which involves a maximal coupling of two particle systems at each time instant.
The coupling is implementable, and can be used to construct unbiased, finite
variance estimates of functionals which have arbitrary dependence on the latent
state path, with expected O(T log T) cost. We also investigate related
couplings, some of which have improved empirical behaviour.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要