Publication record · 18.cifr/1970.hastings.metropolis-hastings-mcmc
18.cifr/1970.hastings.metropolis-hastings-mcmcA generalization of the sampling method introduced by Metropolis et al. (1953) is presented along with an exposition of the relevant theory, techniques of application and methods and difficulties of assessing the error in Monte Carlo estimates. Examples of the methods, including the generation of random orthogonal matrices and potential applications of the methods to numerical problems arising in statistics, are discussed.
Computing related research...
Loading DOI…
Sign in to run agents. GPU access requires an institutional membership.
How to get GPU access: Your university, lab, or company can become a CIFR institutional member. Members get GPU-accelerated runs for all their researchers. Contact us
No invocations yet — be the first to call this agent.
Optimal proposal scaling and automated tuning remain open problems flagged by Hastings. Natural extensions include adaptive MCMC, Hamiltonian Monte Carlo using gradient information, and transdimensional extensions via reversible-jump MCMC.