The paper investigates the Microcanonical Hamiltonian Monte Carlo (MHMC) algorithm from a thermodynamic perspective, deriving its state variables and potentials to show that it represents a microcanonical thermodynamic ensemble. It demonstrates analytically and numerically that MHMC satisfies the Helmholtz theorem, an alternative form of the first law of thermodynamics, and introduces a new sampling algorithm tailored for lower-dimensional inference problems. The authors conclude that canonical Markov Chain Monte Carlo methods are more natural than MHMC when evaluated through thermodynamic and information-theoretic lenses.
arXiv:2608. 07648v1 Announce Type: cross Abstract: Sampling high-dimensional probability distributions is a central task in scientific computing, with applications ranging from Bayesian inference to statistical physics and molecular simulation.
arXiv:2609.15894v1 Announce Type: cross Abstract: Some of the sharpest challenges in sampling from the energy functions of physical systems arise at phase transitions, where the density of states cha...
arXiv:2607. 15682v1 Announce Type: new Abstract: Sampling from an unnormalized Boltzmann density requires proposals that move probability mass globally while retaining enough path-probability information for statistical correction.
arXiv:2607. 00586v2 Announce Type: replace-cross Abstract: We present a simple, yet general approach to study the scaling properties as the dimensionality of Metropolised MCMC sampling algorithms increases.
arXiv:2609.07660v1 Announce Type: cross Abstract: The concept of Markov chain Monte Carlo (MCMC) cycles, an analogy to cyclic processes in heat engines, is presented in order to examine Bayesian infe...
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.
arXiv:2607. 07519v1 Announce Type: new Abstract: 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.
arXiv:2407. 20432v3 Announce Type: replace Abstract: Bayesian inference methods such as Markov Chain Monte Carlo (MCMC) typically require repeated computations of the likelihood function, but in some scenarios this is infeasible and alternative methods are needed.
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:2607. 15208v1 Announce Type: cross Abstract: Unadjusted samplers such as unadjusted Hamiltonian Monte Carlo and underdamped Langevin are well-known to be biased.
arXiv:2606. 30064v1 Announce Type: new Abstract: We introduce a data-driven probabilistic framework for learning systems based on Gibbs measures on hierarchical structures.
arXiv:2505. 12599v3 Announce Type: replace-cross Abstract: We propose a class of discrete state sampling algorithms based on Nesterov's accelerated gradient method, which extends the classical Metropolis-Hastings (MH) algorithm.