Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
We establish L « {L^{\mathfrak{q}}} convergence for Hamiltonian Monte Carlo (HMC) algorithms. More specifically, under mild conditions for the associated Hamiltonian motion, we show that the outputs of the algorithms converge (strongly for 2 ≤ « < ∞ {2\leq\mathfrak{q}<\infty} and weakly for 1 < « < 2 {1<\mathfrak{q}<2}) to the desired target distribution. In addition, we establish a general convergence rate for an L « {L^{\mathfrak{q}}} convergence given a convergence rate at a specific q ∗ {q^{∗}}, and apply this result to conclude geometric convergence in the Euclidean space for HMC with uniformly strongly logarithmic concave target and auxiliary distributions. We also present the results of experiments to illustrate convergence in L « {L^{\mathfrak{q}}}.
Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
T. Graham, A. Afzali, et al.
Microlithography 2000
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997