6 problems
- 0 votes0 replies0 views
Variance bound conjecture for the partially observed McKean–Vlasov estimator
Variance bound conjecture. The variance of the estimator is upper-bounded by an expression of order
- 0 votes0 replies1 view
Particle discretization error conjecture for the bias of Wasserstein particle algorithms
Let be the particle approximation at iteration with particles, let be the target measure, and let be a good approximation of…
- 0 votes0 replies0 views
Particle discretization error conjecture for Wasserstein proximal and Langevin algorithms
Let be the particle approximation produced at iteration with particles, let be the target measure, and let be a numerical referenc…
- 0 votes0 replies0 views
Necessity of bounded transition densities for stochastic-rounding genealogy convergence
Let an SMC algorithm use a stochastic rounding resampling scheme satisfying the standing assumption, and suppose that the incremental transition densities satisfy … for…
- 0 votes0 replies0 views
Uniform particle-system stability for flattened Feynman–Kac models
Let be the state space, let be the initial distribution, and let be the target invariant distribution. For each and , let…
- 0 votes0 replies0 views
Conjecture that the arbitrary-times theorem remains valid
The particle method uses an entropy fix: a merge is rejected a posteriori when the shock-resolution condition is not satisfied, after which points are inserted near the shock and t…