Saved in:
Bibliographic Details
Main Author: Pakman, Ari
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2312.16546
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917860263067648
author Pakman, Ari
author_facet Pakman, Ari
contents Markov Chain Monte Carlo algorithms, the method of choice to sample from generic high-dimensional distributions, are rarely used for continuous one-dimensional distributions, for which more effective approaches are usually available (e.g. rejection sampling). In this work we present a counter-example to this conventional wisdom for the von Mises distribution, a maximum-entropy distribution over the circle. We show that Hamiltonian Monte Carlo with Laplacian momentum has exactly solvable equations of motion and, with an appropriate travel time, the Markov chain has negative autocorrelation at odd lags for odd observables and yields a relative effective sample size bigger than one.
format Preprint
id arxiv_https___arxiv_org_abs_2312_16546
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Super-Efficient Exact Hamiltonian Monte Carlo for the von Mises Distribution
Pakman, Ari
Computation
Markov Chain Monte Carlo algorithms, the method of choice to sample from generic high-dimensional distributions, are rarely used for continuous one-dimensional distributions, for which more effective approaches are usually available (e.g. rejection sampling). In this work we present a counter-example to this conventional wisdom for the von Mises distribution, a maximum-entropy distribution over the circle. We show that Hamiltonian Monte Carlo with Laplacian momentum has exactly solvable equations of motion and, with an appropriate travel time, the Markov chain has negative autocorrelation at odd lags for odd observables and yields a relative effective sample size bigger than one.
title Super-Efficient Exact Hamiltonian Monte Carlo for the von Mises Distribution
topic Computation
url https://arxiv.org/abs/2312.16546