Non-asymptotic Error Bounds for Sequential MCMC Methods in Multimodal Settings
classification
🧮 math.PR
keywords
boundslocalmcmcerrormethodsmultimodalnon-asymptoticsequential
read the original abstract
We prove non-asymptotic error bounds for Sequential MCMC methods in the case of multimodal target distributions. Our bounds depend in an explicit way on upper bounds on relative densities, on constants associated with local mixing properties of the MCMC dynamics, namely, local spectral gaps and local hyperboundedness, and on the amount of probability mass shifted between effectively disconnected components of the state space.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
The Power of Test-Time Training for Approximate Sampling
Establishes a quadratic lower bound on query complexity for sampling from large classes of distributions given approximate density oracles, answers an open question on optimality of random walks, and shows circumventi...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.