On an adaptive version of the Metropolis–Hastings algorithm with independent proposal distribution

DOI10.1111/1467-9469.00324MaRDI QIDQ4455943zbMATH OpenOpenAlexFDO

Authors Jørund Gåsemur

Publication date 16 March 2004

Published in Scandinavian Journal of Statistics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10852/10400

zbMATH Keywords

convergencealgorithmMarkov chain Monte-Carlo methodadaptive independent chainMetropololis-Hastings algorithm

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Bayesian inference (62F15) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40)

Recommendations

• Adaptive independent Metropolis-Hastings
• Pseudo-perfect and adaptive variants of the Metropolis–Hastings algorithm with an independent candidate density
• On adaptive Metropolis-Hastings methods
• Improving Convergence of the Hastings–Metropolis Algorithm with an Adaptive Proposal
• Adaptive Metropolis-Hastings sampling using reversible dependent mixture proposals
• Adaptive proposal distribution for random walk Metropolis algorithm
• scientific article; zbMATH DE number 2148859

Cites work

• A comparison of two sequential Metropolis-Hastings algorithms with standard simulation techniques in Bayesian inference in reliability models involving a generalized gamma distribution
• Exact sampling with coupled Markov chains and applications to statistical mechanics

Cited in

(23)

• Plateau proposal distributions for adaptive component-wise multiple-try metropolis
• Bayesian analysis of the logit model and comparison of two Metropolis-Hastings strategies.
• Adaptive Incremental Mixture Markov Chain Monte Carlo
• Improving Convergence of the Hastings–Metropolis Algorithm with an Adaptive Proposal
• Adaptive Metropolis-Hastings sampling using reversible dependent mixture proposals
• Adaptively scaling the Metropolis algorithm using expected squared jumped distance
• Parallel hierarchical sampling: a general-purpose interacting Markov chains Monte Carlo algorithm
• A multiple-try Metropolis-Hastings algorithm with tailored proposals
• Pseudo-perfect and adaptive variants of the Metropolis–Hastings algorithm with an independent candidate density
• An application of adaptive independent chain Metropolis-Hastings algorithms in Bayesian hazard rate estimation
• scientific article; zbMATH DE number 2189791 (Why is no real title available?)
• Adaptive independent Metropolis-Hastings
• Note on the Sampling Distribution for the Metropolis-Hastings Algorithm
• On adaptive Metropolis-Hastings methods
• Metropolis-Hastings from a stochastic population dynamics perspective
• Tuning of Markov chain Monte Carlo algorithms using copulas
• An adaptive backward coupling Metropolis algorithm for truncated distributions
• Accelerating adaptation in the adaptive Metropolis–Hastings random walk algorithm
• An Adaptive Independence Sampler MCMC Algorithm for Bayesian Inferences of Functions
• Adaptive proposal distribution for random walk Metropolis algorithm
• On the ergodicity properties of some adaptive MCMC algorithms
• Componentwise adaptation for high dimensional MCMC
• Accelerating MCMC via Kriging-based adaptive independent proposals and delayed rejection

This page was built for publication: On an adaptive version of the Metropolis–Hastings algorithm with independent proposal distribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4455943)