The Hastings algorithm at fifty
From MaRDI portal
Recommendations
- Un algorithme de Hastings-Metropolis avec apprentissage séquentiel
- Markov chains for exploring posterior distributions. (With discussion)
- Implementing componentwise Hastings algorithms
- Improving Convergence of the Hastings–Metropolis Algorithm with an Adaptive Proposal
- On the convergence of the Metropolis-Hastings Markov chains
Cited in
(18)- Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference
- Un algorithme de Hastings-Metropolis avec apprentissage séquentiel
- Understanding the Hastings algorithm
- Stochastic gradient Markov chain Monte Carlo
- An Invitation to Sequential Monte Carlo Samplers
- Markov chain Monte Carlo approach to the analysis of response patterns in data collection process
- Distributed computation for marginal likelihood based model choice
- Convergence of unadjusted Hamiltonian Monte Carlo for mean-field models
- Computing Bayes: from then `til now
- Approximating Bayes in the 21st century
- Emerging directions in Bayesian computation
- Efficient Multimodal Sampling via Tempered Distribution Flow
- Convergence rates of Metropolis-Hastings algorithms
- Similarity-based random partition distribution for clustering functional data
- Relative Entropy Gradient Sampler for Unnormalized Distribution
- Zigzag Path Connects Two Monte Carlo Samplers: Hamiltonian Counterpart to a Piecewise Deterministic Markov Process
- PDMP Monte Carlo methods for piecewise smooth densities
- Implementing componentwise Hastings algorithms
This page was built for publication: The Hastings algorithm at fifty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222216)
