Recursive asymptotic-variance conjecture for stratified particle filters

For n1n\geq 1, let Vn+1M(f):=Var(M1/2m=1Mf(Yn+1M,m))V_{n+1}^M(f):=\operatorname{Var}\left(M^{-1/2}\sum_{m=1}^M f(Y_{n+1}^{M,m})\right), and let gng_n, PnP_n, and ηˉn0\bar\eta_n^0 denote the step-nn potential, mutation kernel, and limiting unnormalised measure used by the particle filter. For fBb(Rd)f\in\mathcal{B}_b(\mathbb{R}^d) define

fn:=gn(ηˉn0(gn)fηˉn0(gnf)).f_n:=g_n\left(\bar\eta_n^0(g_n)f-\bar\eta_n^0(g_nf)\right).

Recursive asymptotic-variance conjecture. For each fBb(Rd)f\in\mathcal{B}_b(\mathbb{R}^d),

Var(Mηˉn0,M(gnf)ηˉn0,M(gn))VnM(Pnfn)(ηˉn0(gn))4ηˉn10(gn1(Pnfn2(Pnfn)2))(ηˉn0(gn))4ηˉn10(gn1)M0.\left|\operatorname{Var}\left(\sqrt{M}\frac{\bar\eta_n^{0,M}(g_nf)}{\bar\eta_n^{0,M}(g_n)}\right)-\frac{V_n^M(P_nf_n)}{(\bar\eta_n^0(g_n))^4}-\frac{\bar\eta_{n-1}^0\left(g_{n-1}\left(P_nf_n^2-(P_nf_n)^2\right)\right)}{(\bar\eta_n^0(g_n))^4\bar\eta_{n-1}^0(g_{n-1})}\right|\underset{M\to\infty}{\longrightarrow}0.

The formula extends the explicitly verified n=0n=0 variance asymptotics recursively to later particle-filter steps. It is used to derive the asymptotic variance after mutation and resampling; the source provides no proof or resolution for n1n\geq1.

Sources & referencesView supporting material

Primary source

Roberta Flenghi and Benjamin Jourdain, “Central limit theorem for the stratified resampling mechanism”, arXiv:2308.02186 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.