Literature DB >> 31695242

Neural network gradient Hamiltonian Monte Carlo.

Lingge Li1, Andrew Holbrook2, Babak Shahbaba1, Pierre Baldi1.   

Abstract

Hamiltonian Monte Carlo is a widely used algorithm for sampling from posterior distributions of complex Bayesian models. It can efficiently explore high-dimensional parameter spaces guided by simulated Hamiltonian flows. However, the algorithm requires repeated gradient calculations, and these computations become increasingly burdensome as data sets scale. We present a method to substantially reduce the computation burden by using a neural network to approximate the gradient. First, we prove that the proposed method still maintains convergence to the true distribution though the approximated gradient no longer comes from a Hamiltonian system. Second, we conduct experiments on synthetic examples and real data to validate the proposed method.

Entities:  

Keywords:  Bayesian inference; MCMC; Neural networks

Year:  2019        PMID: 31695242      PMCID: PMC6833949          DOI: 10.1007/s00180-018-00861-z

Source DB:  PubMed          Journal:  Comput Stat        ISSN: 0943-4062            Impact factor:   1.000


  2 in total

1.  A theory of local learning, the learning channel, and the optimality of backpropagation.

Authors:  Pierre Baldi; Peter Sadowski
Journal:  Neural Netw       Date:  2016-08-05

2.  Hamiltonian Monte Carlo acceleration using surrogate functions with random bases.

Authors:  Cheng Zhang; Babak Shahbaba; Hongkai Zhao
Journal:  Stat Comput       Date:  2016-09-13       Impact factor: 2.559

  2 in total
  1 in total

1.  Massive parallelization boosts big Bayesian multidimensional scaling.

Authors:  Andrew J Holbrook; Philippe Lemey; Guy Baele; Simon Dellicour; Dirk Brockmann; Andrew Rambaut; Marc A Suchard
Journal:  J Comput Graph Stat       Date:  2020-06-08       Impact factor: 2.302

  1 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.