arXiv:2605. 30722v2 Announce Type: replace Abstract: We propose CerT-MCMC, a framework that equips learned-transport Markov chain Monte Carlo with automatic, rigorous convergence certificates.
arXiv:2606. 01078v1 Announce Type: new Abstract: Transport MCMC trains a normalizing flow to precondition Metropolis--Hastings proposals, achieving high empirical efficiency on challenging posteriors; yet no prior work produces a numerically non-vacuous, rigorous spectral-gap bound for such samplers.
arXiv:2606. 04307v1 Announce Type: new Abstract: Bayesian models with finite symmetry - mixture models with exchangeable components, structural identification with closely-spaced modes - define posteriors that are invariant under a group of label permutations, creating redundant multimodality that degrades MCMC convergence diagnostics.
arXiv:2605. 23434v2 Announce Type: replace Abstract: Approximate inference over inducing variables is the central computational bottleneck of Deep Gaussian Processes (DGPs).
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.
arXiv:2607. 16811v4 Announce Type: replace Abstract: Drift detectors that work tend not to explain themselves, and drift detectors that explain themselves tend to fail in high dimension.
arXiv:2607. 03809v1 Announce Type: new Abstract: Normalising flows provide a powerful variational family for approximate inference, yet individual architectures often fail to generalise across heterogeneous posterior geometries.
arXiv:2607. 04113v1 Announce Type: new Abstract: Diffusion and flow-matching samplers integrate a learned probability-flow ODE from a large noise scale down to a small terminal floor $\sigma_{\min}$, at which the score is stiff and the flow develops a boundary layer.
arXiv:2608. 01793v1 Announce Type: new Abstract: Unified anomaly detection requires modeling highly heterogeneous normal data without access to anomalous samples.
Diffusion and flow-matching samplers integrate a learned probability-flow ODE from a large noise scale down to a small terminal floor $σ_{\min}$, at which the score is stiff and the flow develops a boundary layer. We treat $σ_{\min}$ as a singular-perturbation parameter and determine which fixed-step samplers are asymptotic-preserving (AP), that is, stable and uniformly accurate as $σ_{\min}\to0$, casting the criteria as an a posteriori audit: residual functionals with $σ_{\min}$-uniform coefficients, computable on a pretrained checkpoint without ground-truth scores or exact trajectories.
The paper presents a non‑asymptotic analysis of Markov chain Monte Carlo (MCMC) algorithms that learn and apply a preconditioner based on either the target covariance or the expected Hessian of the target potential. It compares the finite‑time computational costs of these preconditioned schemes with unpreconditioned counterparts, providing guarantees for algorithms such as the Unadjusted Langevin Algorithm (ULA) and the proximal sampler. The analysis relies on a contraction assumption in the Wasserstein‑2 distance to formalize approximate independence and bridge modern MCMC theory with classical effective sample size heuristics.
arXiv:2508. 15318v5 Announce Type: replace-cross Abstract: Markov chain Monte Carlo (MCMC) is a standard tool for studying many-body systems, but its practical cost can become substantial, especially when simulations must be repeated across temperatures and lattice sizes or near transition regions where equilibration becomes increasingly difficult.
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.