Quantum-Inspired Hamiltonian Monte Carlo for Bayesian Sampling
arXiv:1912.01937
Abstract
Hamiltonian Monte Carlo (HMC) is an efficient Bayesian sampling method that can make distant proposals in the parameter space by simulating a Hamiltonian dynamical system. Despite its popularity in machine learning and data science, HMC is inefficient to sample from spiky and multimodal distributions. Motivated by the energy-time uncertainty relation from quantum mechanics, we propose a Quantum-Inspired Hamiltonian Monte Carlo algorithm (QHMC). This algorithm allows a particle to have a random mass matrix with a probability distribution rather than a fixed mass. We prove the convergence property of QHMC and further show why such a random mass can improve the performance when we sample a broad class of distributions. In order to handle the big training data sets in large-scale machine learning, we develop a stochastic gradient version of QHMC using Nos{é}-Hoover thermostat called QSGNHT, and we also provide theoretical justifications about its steady-state distributions. Finally in the experiments, we demonstrate the effectiveness of QHMC and QSGNHT on synthetic examples, bridge regression, image denoising and neural network pruning. The proposed QHMC and QSGNHT can indeed achieve much more stable and accurate sampling results on the test cases.
arXiv comment38 pages, 15 figures
References in corpus (9)
- Deep Learning in Neural Networks: An Overview
- Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination
- A Conceptual Introduction to Hamiltonian Monte Carlo
- Asymptotic properties of bridge estimators in sparse high-dimensional regression models
- Stochastic Gradient Hamiltonian Monte Carlo
- Randomized Hamiltonian Monte Carlo
- Discontinuous Hamiltonian Monte Carlo for discrete parameters and discontinuous likelihoods
- Magnetic Hamiltonian Monte Carlo
- Relativistic Monte Carlo