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: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: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:2605. 23434v2 Announce Type: replace Abstract: Approximate inference over inducing variables is the central computational bottleneck of Deep Gaussian Processes (DGPs).
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.
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.
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:2608.23094v1 Announce Type: new Abstract: One implicit DDIM inversion step is the cheapest probe of whether a pretrained diffusion model encodes local manifold geometry. It is the stationarity...
arXiv:2606. 03820v1 Announce Type: cross Abstract: We develop a quantitative approximation framework for diffusion distillation, viewing few-step sampling as error propagation under compositions of learned flow maps.
arXiv:2608. 01547v1 Announce Type: cross Abstract: Drifting objectives compare a target and model distribution through a vector field observed noisily at finitely many locations.
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:2608. 28262v1 Announce Type: new Abstract: Entropic optimal transport (EOT) has been shown to offer a computationally tractable approximation to exact optimal transport.
The paper introduces NS‑Flows, a flow‑based nested sampling method that replaces Markov‑chain updates with a conditional normalizing flow trained on live sets. By applying this technique to a Lennard‑Jones particle system, the authors achieve over two orders of magnitude fewer energy evaluations and a roughly one‑third reduction in wall‑clock time compared to traditional nested sampling. The study also shows that the flow’s generation efficiency varies non‑monotonically along the annealing trajectory, providing a diagnostic of the system’s internal mode complexity and identifying liquid‑like ensembles as the most challenging for current flow architectures.