mlsanityData to 14 Oct 2026

Resonances in reflective Hamiltonian Monte Carlo

arXiv 2504.12374 ↗First posted 16 Apr 2025stat.ML cond-mat.stat-mech cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

In high dimensions, reflective Hamiltonian Monte Carlo with inexact reflections exhibits slow mixing when the particle ensemble is initialised from a Dirac delta distribution and the uniform distribution is targeted. By quantifying the instantaneous non-uniformity of the distribution with the Sinkhorn divergence, we elucidate the principal mechanisms underlying the mixing problems. In spheres and cubes, we show that the collective motion transitions between fluid-like and discretisation-dominated behaviour, with the critical step size scaling as a power law in the dimension. In both regimes, the particles can spontaneously unmix, leading to resonances in the particle density and the aforementioned problems. Additionally, low-dimensional toy models of the dynamics are constructed which reproduce the dominant features of the high-dimensional problem. Finally, the dynamics is contrasted with the exact Hamiltonian particle flow and tuning practices are discussed.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 11 of its 55 references that are in the map. First posted on arXiv 16 Apr 2025.

Builds on

11 of 55 references.

References · 11

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  3. 2015Automatic differentiation in machine learning: a surveycited by 855
  4. 2017Learning Generative Models with Sinkhorn Divergencescited by 314
  5. 2020Machine Learning Force Fieldscited by 207
  6. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 189
  7. 2022Optimal Transport Tools (OTT): A JAX Toolbox for all things Wassersteincited by 101
  8. 2023Improving Gradient-guided Nested Sampling for Posterior Inferencecited by 14
  9. 2013Efficient Random-Walk Methods for Approximating Polytope Volumecited by 3
  10. 2022Efficient computation of the volume of a polytope in high-dimensions using Piecewise Deterministic Markov Processescited by 3
  11. 2023Kernel-, mean- and noise-marginalised Gaussian processes for exoplanet transits and H0 inferencecited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 4.

4 papers.