arxiv
PublishedJuly 14, 2026 at 4:00 AM
—neutral
Optimal scaling of MCMC algorithms: the Hamiltonian approach
Publisher summary· verbatim
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. The study relies on the symmetries of the Hamiltonian formalism and ultimately on the symmetry
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
The Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗