English
Related papers

Related papers: From Continuous to Discrete: a No-U-Turn Sampler f…

200 papers

The paper proposes a Riemannian Manifold Hamiltonian Monte Carlo sampler to resolve the shortcomings of existing Monte Carlo algorithms when sampling from target densities that may be high dimensional and exhibit strong correlations. The…

Computation · Statistics 2019-12-18 Mark Girolami , Ben Calderhead , Siu A. Chin

Increasingly complex datasets pose a number of challenges for Bayesian inference. Conventional posterior sampling based on Markov chain Monte Carlo can be too computationally intensive, is serial in nature and mixes poorly between posterior…

Machine Learning · Statistics 2019-08-27 Edwin Fong , Simon Lyddon , Chris Holmes

In this work, we introduce the No-Underrun Sampler (NURS), a locally-adaptive, gradient-free Markov chain Monte Carlo method that blends ideas from Hit-and-Run and the No-U-Turn Sampler. NURS dynamically adapts to the local scale of the…

Statistics Theory · Mathematics 2025-02-27 Nawaf Bou-Rabee , Bob Carpenter , Sifan Liu , Stefan Oberdörster

Locally adapting parameters within Markov chain Monte Carlo methods while preserving reversibility is notoriously difficult. The success of the No-U-Turn Sampler (NUTS) largely stems from its clever local adaptation of the integration time…

Computation · Statistics 2025-06-24 Nawaf Bou-Rabee , Bob Carpenter , Tore Selland Kleppe , Sifan Liu

Gradients have been exploited in proposal distributions to accelerate the convergence of Markov chain Monte Carlo algorithms on discrete distributions. However, these methods require a natural differentiable extension of the target discrete…

Machine Learning · Computer Science 2023-02-28 Yue Xiang , Dongyao Zhu , Bowen Lei , Dongkuan Xu , Ruqi Zhang

We analyse how the sampling dynamics of distributions evolve in score-based diffusion models using cross-fluctuations, a centered-moment statistic from statistical physics. Specifically, we show that starting from an unbiased isotropic…

Machine Learning · Computer Science 2026-05-04 Sai Niranjan Ramachandran , Manish Krishan Lal , Suvrit Sra

The spectral gap $\gamma$ of a finite, ergodic, and reversible Markov chain is an important parameter measuring the asymptotic rate of convergence. In applications, the transition matrix $P$ may be unknown, yet one sample of the chain up to…

Statistics Theory · Mathematics 2017-08-25 Daniel Hsu , Aryeh Kontorovich , David A. Levin , Yuval Peres , Csaba Szepesvári

Discrete Markov random fields are undirected graphical models that capture complex conditional dependencies between discrete variables. Conducting exact posterior inference in these models is often computationally challenging because…

Methodology · Statistics 2026-03-10 Giuseppe Arena , Maarten Marsman

We investigate the class of $\sigma$-stable Poisson-Kingman random probability measures (RPMs) in the context of Bayesian nonparametric mixture modeling. This is a large class of discrete RPMs which encompasses most of the the popular…

Computation · Statistics 2018-02-22 María Lomelí , Stefano Favaro , Yee Whye Teh

Evaluating the degree of partisan districting (Gerrymandering) in a statistical framework typically requires an ensemble of districting plans which are drawn from a prescribed probability distribution that adheres to a realistic and…

Computation · Statistics 2020-08-19 Gregory Herschlag , Jonathan C. Mattingly , Matthias Sachs , Evan Wyse

Even in low dimensions, sampling from multi-modal distributions is challenging. We provide the first sampling algorithm for a broad class of distributions -- including all Gaussian mixtures -- with a query complexity that is polynomial in…

Computation · Statistics 2025-10-24 Adrien Vacher , Omar Chehab , Anna Korba

The most common way to sample from a probability distribution is to use Monte-Carlo methods. For distributions on a continuous state space, one can find diffusions with the target distribution as equilibrium measure, so that the state of…

Probability · Mathematics 2015-10-28 Chii-Ruey Hwang , Raoul Normand , Sheng-Jhih Wu

This paper introduces the Boomerang Sampler as a novel class of continuous-time non-reversible Markov chain Monte Carlo algorithms. The methodology begins by representing the target density as a density, $e^{-U}$, with respect to a…

Computation · Statistics 2020-08-12 Joris Bierkens , Sebastiano Grazzi , Kengo Kamatani , Gareth Roberts

We propose a modified coupled cluster Monte Carlo algorithm that stochastically samples connected terms within the truncated Baker--Campbell--Hausdorff expansion of the similarity transformed Hamiltonian by construction of coupled cluster…

Chemical Physics · Physics 2019-06-19 Charles J. C. Scott , Roberto Di Remigio , T. Daniel Crawford , Alex J. W. Thom

We study $4$-dimensional $SU(N)\times U(1)$ gauge theories with a single massless Dirac fermion in the $2$-index symmetric/antisymmetric representations and show that they are endowed with a noninvertible $0$-form $\widetilde {\mathbb…

High Energy Physics - Theory · Physics 2023-08-23 Mohamed M. Anber , Erich Poppitz

A Bayesian nonparametric method for unimodal densities on the real line is provided by considering a class of species sampling mixture models containing random densities that are unimodal and not necessarily symmetric. This class of…

Statistics Theory · Mathematics 2007-06-13 Man-Wai Ho

In this paper we study asymptotic properties of different data-augmentation-type Markov chain Monte Carlo algorithms sampling from mixture models comprising discrete as well as continuous random variables. Of particular interest to us is…

Computation · Statistics 2014-04-04 Randal Douc , Florian Maire , Jimmy Olsson

One-dimensional scattering mediated by non-Hermitian Hamiltonians is studied. A schematic set of models is used which simulate two point interactions at a variable strength and distance. The feasibility of the exact construction of the…

Quantum Physics · Physics 2008-06-26 Miloslav Znojil

We construct a continuous-time non-commutative random walk on $U(\mathfrak{gl}_N)$ with dilation maps $U(\mathfrak{gl}_N)\rightarrow L^2(U(N))^{\otimes\infty}$. This is an analog of a continuous-time non-commutative random walk on the group…

Representation Theory · Mathematics 2016-12-20 Jeffrey Kuan

In this paper we propose a new approach for sampling from probability measures in, possibly, high dimensional spaces. By perturbing the standard overdamped Langevin dynamics by a suitable Stratonovich perturbation that preserves the…

Numerical Analysis · Mathematics 2019-04-23 Assyr Abdulle , Grigorios A. Pavliotis , Gilles Vilmart