Handbook of Markov Chain Monte Carlo
By Radford M. Neal. 2011
3,463 citations recorded by the source corpus.
Foreword Stephen P. Brooks, Andrew Gelman, Galin L. Jones, and Xiao-Li Meng Introduction to MCMC, Charles J. Geyer A short history of Markov chain Monte Carlo: Subjective recollections from in-complete data, Christian Robert and George Casella Reversible jump Markov chain Monte Carlo, Yanan Fan and Scott A. Sisson Optimal proposal distributions and adaptive MCMC, Jeffrey S. Rosenthal MCMC using Hamiltonian dynamics, Radford M. Neal Inference and Monitoring Convergence, Andrew Gelman and Kenneth Shirley Implementing MCMC: Estimating with confidence, James M. Flegal and Galin L. Jones Perfection within reach: Exact MCMC sampling, Radu V. Craiu and Xiao-Li Meng Spatial point processes, Mark Huber The data augmentation algorithm: Theory and methodology, James P. Hobert Importance sampling, simulated tempering and umbrella sampling, Charles J.Geyer Likelihood-free Markov chain Monte Carlo, Scott A. Sisson and Yanan Fan MCMC in the analysis of genetic data on related individuals, Elizabeth Thompson A Markov chain Monte Carlo based analysis of a multilevel model for functional MRI data, Brian Caffo, DuBois Bowman, Lynn Eberly, and Susan Spear Bassett Partially collapsed Gibbs sampling & path-adaptive Metropolis-Hastings in high-energy astrophysics, David van Dyk and Taeyoung Park Posterior exploration for computationally intensive forward models, Dave Higdon, C. Shane Reese, J. David Moulton, Jasper A. Vrugt and Colin Fox Statistical ecology, Ruth King Gaussian random field models for spatial data, Murali Haran Modeling preference changes via a hidden Markov item response theory model, Jong Hee Park Parallel Bayesian MCMC imputation for multiple distributed lag models: A case study in environmental epidemiology, Brian Caffo, Roger Peng, Francesca Dominici, Thomas A. Louis, and Scott Zeger MCMC for state space models, Paul Fearnhead MCMC in educational research, Roy Levy, Robert J. Mislevy, and John T. Behrens Applications of MCMC in fisheries science, Russell B. Millar Model comparison and simulation for hierarchical models: analyzing rural-urban migration in Thailand, Filiz Garip and Bruce Western
Subfields: Statistics and Probability, Probabilistic & Bayesian Methods
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Statistics and Probability
- Qiang Liu
- David M. Blei
- Arthur Gretton
- Zoubin Ghahramani
- Michael I. Jordan
- Bernhard Schölkopf
- Paul-Christian Burkner
- Matthew D. Hoffman
In Probabilistic & Bayesian Methods
- David M. Blei
- Zoubin Ghahramani
- Frank D. Wood
- Stefano Ermon
- Qiang Liu
- Richard E. Turner
- Yoshua Bengio
- Matthew D. Hoffman
Citations in the corpus
- Energy-Inspired Models: Learning with Sampler-Induced Distributions (2019, methodology): “Hamiltonian Monte Carlo [54] is another choice which can also be embedded in this framework as done by [61, 10].”
- Learning Energy-Based Spatial-Temporal Generative ConvNets for Dynamic Patterns (2019, methodology): “The Langevin dynamics can be extended to Hamiltonian Monte Carlo [56] or more sophisticated versions [57].”
- Learning Generative ConvNets via Multi-grid Modeling and Sampling (2017, methodology): “We have also implemented Hamiltonian Monte Carlo (HMC) for sampling the generative ConvNet [33, 4].”
- On the Quantitative Analysis of Decoder-Based Generative Models (2016, methodology): “Since all of our experiments are done using continuous latent space, we use Hamiltonian Monte Carlo [19] as the transition operator for sampling latent samples along annealing.”
- Gradient-free Hamiltonian Monte Carlo with Efficient Kernel Exponential Families (2015, methodology): “We aim to overcome random-walk behaviour, so as to obtain significantly more efficient sampling [1].”
- Discriminative k-shot learning using probabilistic models (2017, methodology): “Table 2 shows that our probabilistic models are competitive with the current state-of-the-art Prototypical Networks on miniImageNet splits from [11] and outperform many of the other methods.”
- GenDICE: Generalized Offline Estimation of Stationary Values (2020, background): “Amortized SVGD (Wang & Liu, 2016) and Adversarial MCMC (Song et al., 2017; Li et al., 2019) alleviate this issue via combining with neural network, but they still interact with the transition operator directly, i.e., in an on-policy setting.”
- Bayesian dark knowledge (2015, neutral): “We see that this is a good approximation to the HMC distribution.”
- Picture: A probabilistic programming language for scene perception (2015, methodology): “…to obtain ∇ S real ρ using reverse mode automatic differentiation, where S real ∈ S ρ denotes all continuous variables. automatically This enables us to automatically construct Hamiltonian Monte Carlo proposals[34, 45] q hmc ( S → S (cid:48) ) (see supplementary material for a simple example).”
- Normalizing Flows for Probabilistic Modeling and Inference (2019, neutral): “One prominent example is Hamiltonian Monte Carlo (HMC), also known as Hybrid Monte Carlo (Duane et al., 1987; Neal, 2010).”
- Learning Generative Models with Visual Attention (2013, background): “6.2, we demonstrate the ability to learn a good generative model of face images from the CMU Multi-PIE dataset.”
- Minimum Probability Flow Learning (2009, methodology): “Borrowing techniques from Hamiltonian Monte Carlo [Neal(2010)] we use Hamiltonian dynamics in our transition function, so as to effectively explore the state space.”