A Monte Carlo Metropolis-Hastings Algorithm for Sampling from Distributions with Intractable Normalizing Constants

DOI10.1162/NECO_a_00466zbMath1448.62040WikidataQ44408840 ScholiaQ44408840MaRDI QIDQ5378252

Ick Hoon Jin, Faming Liang

Publication date: 12 June 2019

Published in: Neural Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Bayesian inference (62F15) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Bayesian Inference in the Presence of Intractable Normalizing Functions, Exponential-family models of random graphs: inference in finite, super and infinite population scenarios, Bayesian model selection for high-dimensional Ising models, with applications to educational data

Uses Software

• GMRFLib
• tsbridge
• bootstrap

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The pseudo-marginal approach for efficient Monte Carlo computations
• On Monte Carlo methods for estimating ratios of normalizing constants
• Inference from iterative simulation using multiple sequences
• Markov chains for exploring posterior distributions. (With discussion)
• A double Metropolis–Hastings sampler for spatial models with intractable normalizing constants
• Goodness of Fit of Social Network Models
• Markov Graphs
• Hidden Markov Models and Disease Mapping
• Gaussian Markov Random Fields
• Modelling Spatial Patterns of Trees Attacked by Bark-Beetles
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• On estimation in binary autologistic spatial models
• An efficient Markov chain Monte Carlo method for distributions with intractable normalising constants
• Simulating normalizing constants: From importance sampling to bridge sampling to path sampling
• Lectures on Monte Carlo methods