CORTEXA
← Browse
arxivstat.COstat.ML2026-07-13

Markov Chain Monte Carlo with Diffusion Paths

Han Chen, Sifan Liu, Jun Yang

Sampling from multimodal distributions is a longstanding challenge for classical local Markov chain Monte Carlo (MCMC) methods. A popular remedy is to introduce a sequence of intermediate distributions that interpolate between the target and a simpler reference. The classical choice, tempering, raises the density to a power, but distorts the relative weights of asymmetric modes and can lead to poor mixing. We instead propose interpolating along the diffusion path, the marginals of a noising diffusion process that carries the target toward a Gaussian. This path preserves the relative weights of the modes and enjoys favorable mixing properties, which we make precise through a spectral-gap analysis of the corresponding ideal transition kernel. Sampling along the path requires its intermediate scores, which can be estimated from the unnormalized target through variational approaches, yielding only an approximate sampler. To remove the resulting bias, we introduce the Metropolis-adjusted diffusion path (MAD-Path) sampler, which corrects the diffusion-path proposal in an augmented path space and leaves the target invariant regardless of the accuracy of the learned score or the discretization error. We further quantify how these two errors affect the acceptance probability, providing guidance for practical tuning. Experiments on a range of Bayesian posteriors show that MAD-Path improves global exploration and mode-weight estimation relative to tempering-based MCMC methods and unadjusted diffusion samplers.

View free PDFSource page

Related papers

arxivstat.MLcs.DScs.LGmath.PRmath.STstat.CO2026-07-14

Accelerated Mixing Time of Randomized Hamiltonian Monte Carlo

Siddharth Mitra, Vishwak Srinivasan, Xiuyuan Wang, Andre Wibisono

We show the Randomized Hamiltonian Monte Carlo (RHMC) algorithm has accelerated mixing time guarantees for sampling from log-concave probability distributions. RHMC proceeds by repeatedly simulating the continuous-time Hamiltonian dynamics for some random integration times, and r…

View free PDFSource page
arxivstat.COcs.LGmath.PRstat.ML2026-07-16

Delocalization of bias in unadjusted Hamiltonian Monte Carlo and underdamped Langevin

Yifan Chen, Xiaoou Cheng, Jonathan Niles-Weed, Jonathan Weare

Unadjusted samplers such as unadjusted Hamiltonian Monte Carlo and underdamped Langevin are well-known to be biased. Metropolis--Hastings adjustment has been conventionally incorporated into Hamiltonian Monte Carlo to eliminate the bias. However, this adjustment can significantly…

View free PDFSource page
arxivstat.MLcs.LGmath.PRstat.APstat.COstat.ME2026-07-21

A Bayesian Framework for Built-in Input Dimension Reduction for Gaussian Process Modeling

Eric Herrison Gyamfi, Emily L. Kang, Bledar A. Konomi, Guang Lin

Gaussian process (GP) modeling is widely used in computational science and engineering. However, fitting a GP to high-dimensional inputs remains challenging due to the curse of dimensionality. While various methods have been proposed to reduce input dimensionality, they typically…

View free PDFSource page
arxivstat.MEmath.STstat.COstat.ML2026-07-24

The V-fold jackknife for semiparametric inference: variance estimation, confidence intervals, and simultaneous confidence bands

Yi Li, Ashkan Ertefaie, Mark van der Laan

For decades, the bootstrap has been a default tool for statistical inference because of its broad applicability and minimal analytic requirements. Although its validity is well understood for smooth parametric estimators, its theoretical properties for many modern semiparametric…

View free PDFSource page
arxivstat.MEcs.LGstat.APstat.COstat.ML2026-07-23

Distributional Determinantal Point Process for Repulsive Clustering of Distributions

Khai Nguyen, Yang Ni, Elizabeth Juarez-Colunga, Peter Mueller

We introduce the distributional determinantal point process (dDPP) as a novel repulsive point process whose atoms are probability distributions rather than points in a real space. The dDPP is constructed via an L-ensemble with a sliced Wasserstein (SW) kernel between distribution…

View free PDFSource page
arxivstat.MLcs.LGmath.NAstat.CO2026-07-24

Convergence analysis of a family of Zermelo-type iterations for the Bradley--Terry model

Ruijian Han, Ding Lu, Yiming Xu

Zermelo's algorithm is a classical method for computing the maximum likelihood estimator in the Bradley--Terry (BT) model, but its convergence can be slow in practice. To accelerate computation, Newman introduced a family of Zermelo-type fixed-point iterations parameterized by $α…

View free PDFSource page