The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.
The paper introduces the concept of local geometric mixing, which focuses on geometric convergence to equilibrium in total variation over a finite number of transitions, thereby capturing rapid local equilibration even when global mixing is slow. It derives local geometric mixing bounds using Dobrushin contraction and applies these results to Diffusion Path Monte Carlo, a Markov chain Monte Carlo method that aligns with the Proximal Sampler. The analysis provides mixing guarantees for both the ideal method and its Metropolis-adjusted implementation, and extends recent spectral gap estimates into mixing time bounds.
The paper introduces a new Markov chain Monte Carlo method that samples from multimodal distributions by interpolating along the diffusion path of a noising diffusion process, preserving mode weights and improving mixing. It proposes a Metropolis-adjusted diffusion path (MAD-Path) sampler that corrects for bias from approximate score estimates and discretization errors, ensuring the target distribution remains invariant. Experiments on Bayesian posteriors demonstrate that MAD-Path outperforms tempering-based MCMC and unadjusted diffusion samplers in global exploration and accurate mode-weight estimation.
We address the problem of efficiently sampling multimodal probability distributions, where standard Markov Chain Monte Carlo methods often suffer from poor mixing and mode trapping. To mitigate these issues, we propose Gradient-free Riemannian Langevin Sampler (GRiLS), a novel proposal that improves exploration without requiring gradient evaluations of the target density.
Sequential Monte Carlo (SMC) methods are a natural tool for post-hoc conditioning of pretrained generative models, but in many applications the mutation kernels used by the particle system are biased approximations of an ideal Feynman--Kac flow. This paper develops a non-asymptotic error analysis for such SMC samplers.
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:2607.04780v2 Announce Type: replace-cross Abstract: Post-hoc conditioning of pretrained diffusion models can be addressed using Sequential Monte Carlo (SMC) methods. By evolving an interacting...