- Bayesian Anal.
- Volume 13, Number 2 (2018), 485-506.
Variational Hamiltonian Monte Carlo via Score Matching
Traditionally, the field of computational Bayesian statistics has been divided into two main subfields: variational methods and Markov chain Monte Carlo (MCMC). In recent years, however, several methods have been proposed based on combining variational Bayesian inference and MCMC simulation in order to improve their overall accuracy and computational efficiency. This marriage of fast evaluation and flexible approximation provides a promising means of designing scalable Bayesian inference methods. In this paper, we explore the possibility of incorporating variational approximation into a state-of-the-art MCMC method, Hamiltonian Monte Carlo (HMC), to reduce the required expensive computation involved in the sampling procedure, which is the bottleneck for many applications of HMC in big data problems. To this end, we exploit the regularity in parameter space to construct a free-form approximation of the target distribution by a fast and flexible surrogate function using an optimized additive model of proper random basis, which can also be viewed as a single-hidden layer feedforward neural network. The surrogate function provides sufficiently accurate approximation while allowing for fast computation in the sampling procedure, resulting in an efficient approximate Bayesian inference algorithm. We demonstrate the advantages of our proposed method using both synthetic and real data problems.
Bayesian Anal., Volume 13, Number 2 (2018), 485-506.
First available in Project Euclid: 25 July 2017
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zhang, Cheng; Shahbaba, Babak; Zhao, Hongkai. Variational Hamiltonian Monte Carlo via Score Matching. Bayesian Anal. 13 (2018), no. 2, 485--506. doi:10.1214/17-BA1060. https://projecteuclid.org/euclid.ba/1500948232
- Variational Hamiltonian Monte Carlo via Score Matching – Supplementary Materials.