Unbiased constrained sampling with Self-Concordant Barrier Hamiltonian Monte Carlo

Research output: Contribution to journalConference articlepeer-review

Abstract

In this paper, we propose Barrier Hamiltonian Monte Carlo (BHMC), a version of the HMC algorithm which aims at sampling from a Gibbs distribution π on a manifold M, endowed with a Hessian metric g derived from a self-concordant barrier.Our method relies on Hamiltonian dynamics which comprises g.Therefore, it incorporates the constraints defining M and is able to exploit its underlying geometry.However, the corresponding Hamiltonian dynamics is defined via non separable Ordinary Differential Equations (ODEs) in contrast to the Euclidean case.It implies unavoidable bias in existing generalization of HMC to Riemannian manifolds.In this paper, we propose a new filter step, called “involution checking step”, to address this problem.This step is implemented in two versions of BHMC, coined continuous BHMC (c-BHMC) and numerical BHMC (n-BHMC) respectively.Our main results establish that these two new algorithms generate reversible Markov chains with respect to π and do not suffer from any bias in comparison to previous implementations.Our conclusions are supported by numerical experiments where we consider target distributions defined on polytopes.

Original languageEnglish
JournalAdvances in Neural Information Processing Systems
Volume36
Publication statusPublished - 1 Jan 2023
Event37th Conference on Neural Information Processing Systems, NeurIPS 2023 - New Orleans, United States
Duration: 10 Dec 202316 Dec 2023

Fingerprint

Dive into the research topics of 'Unbiased constrained sampling with Self-Concordant Barrier Hamiltonian Monte Carlo'. Together they form a unique fingerprint.

Cite this