2 citations · 2 across the 1 of their papers we have counts for
1 paper
Joseph Mathews, Scott C. Schmidler
We prove finite sample complexities for sequential Monte Carlo (SMC) algorithms which require only local mixing times of the associated Markov kernels. Our bounds are particularly…