arXiv Statistics ML
Uniform ergodicity and spectral gap of importance-tempered MCMC with heavy-tailed targets
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Statistics ML
Sep 17
Spectral gap of Metropolis-within-Gibbs under log-concavity
arXiv:2509. 26175v2 Announce Type: replace Abstract: The Metropolis-within-Gibbs (MwG) algorithm is a widely used Markov chain Monte Carlo method for sampling from high-dimensional distributions when exact conditional sampling is intractable.
arXiv Machine Learning
Aug 5
A Direct Route to Markov Chain Convergence via Asymptotic Equivalence with the Target
arXiv:2608. 03353v1 Announce Type: cross Abstract: For a Markov kernel $T$ with an invariant probability measure $\pi$, we give a self-contained proof of the Markov chain convergence theorem via a criterion called asymptotic equivalence with the target.
arXiv Machine Learning
Jul 14
Gaussian Invariant Markov Chain Monte Carlo
arXiv:2506. 21511v2 Announce Type: replace-cross Abstract: We develop sampling methods, which consist of Gaussian invariant versions of random walk Metropolis (RWM), Metropolis adjusted Langevin algorithm (MALA) and second order Hessian or Manifold MALA.
arXiv Machine Learning
Jul 2
Optimal scaling of MCMC algorithms: exploiting the symmetry of the Metropolis-Hastings formula
arXiv:2607. 00586v1 Announce Type: cross Abstract: We present a simple, yet general approach to study the scaling properties as the dimensionality of Metropolised MCMC sampling algorithms increases.
arXiv Statistics ML
Aug 27
Provable Non-Acceleration of Standard Strang Splittings of Kinetic Langevin Dynamics
arXiv:2608.25279v1 Announce Type: cross Abstract: The OBABO and BAOAB schemes and the other standard Strang splittings of kinetic (underdamped) Langevin dynamics are widely used Markov chain Monte Ca...
arXiv Machine Learning
Jul 14
Optimal scaling of MCMC algorithms: the Hamiltonian approach
arXiv:2607. 00586v2 Announce Type: replace-cross Abstract: We present a simple, yet general approach to study the scaling properties as the dimensionality of Metropolised MCMC sampling algorithms increases.