mlsanityData to 7 Oct 2026

Variational Inference with Hamiltonian Monte Carlo

arXiv 1609.08203 ↗First posted 26 Sep 2016stat.MLcited by 17

Not on the map. Why?

Abstract (arXiv)

Variational inference lies at the core of many state-of-the-art algorithms. To improve the approximation of the posterior beyond parametric families, it was proposed to include MCMC steps into the variational lower bound. In this work we explore this idea using steps of the Hamiltonian Monte Carlo (HMC) algorithm, an efficient MCMC method. In particular, we incorporate the acceptance step of the HMC algorithm, guaranteeing asymptotic convergence to the true posterior. Additionally, we introduce some extensions to the HMC algorithm geared towards faster convergence. The theoretical advantages of these modifications are reflected by performance improvements in our experimental results.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Sep 2016.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 5; 2022: 6; 2023: 3; 2024: 1; 2025: 2.

17 papers.

Sort: