Papers › Split Hamiltonian Monte Carlo revisited
Split Hamiltonian Monte Carlo revisited
Fernando Casas, Jesús María Sanz-Serna, Luke Shaw
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We study Hamiltonian Monte Carlo (HMC) samplers based on splitting the Hamiltonian H as H₀(θ,p)+U₁(θ), where H₀ is quadratic and U₁ small. We show that, in general, such samplers suffer from stepsize stability restrictions similar to those of algorithms based on the standard leapfrog integrator. The restrictions may be circumvented by preconditioning the dynamics. Numerical experiments show that, when the H₀(θ,p)+U₁(θ) splitting is combined with preconditioning, it is possible to construct samplers far more efficient than standard leapfrog HMC.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections