A multiple-try Metropolis-Hastings algorithm with tailored proposals
From MaRDI portal
Publication:2319482
DOI10.1007/s00180-019-00878-yzbMath1505.62261arXiv1807.01914OpenAlexW2810256321WikidataQ128246492 ScholiaQ128246492MaRDI QIDQ2319482
Publication date: 19 August 2019
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.01914
Computational methods for problems pertaining to statistics (62-08) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40)
Related Items
A Quantum Parallel Markov Chain Monte Carlo ⋮ Generating MCMC proposals by randomly rotating the regular simplex
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
- A multi-point Metropolis scheme with generic weight functions
- Facies modeling using a Markov mesh model specification
- Interacting multiple try algorithms with different proposal distributions
- Scaling analysis of multiple-try MCMC methods
- Image analysis with partially ordered Markov models.
- A generalized multiple-try version of the reversible jump algorithm
- On the flexibility of the design of multiple try Metropolis schemes
- Prior specification for binary Markov mesh models
- Issues in the multiple try Metropolis mixing
- Approximate computations for binary Markov random fields and their use in Bayesian models
- Tailored randomized block MCMC methods with application to DSGE models
- Mode Jumping Proposals in MCMC
- On the Flexibility of Metropolis-Hastings Acceptance Probabilities in Auxiliary Variable Proposal Generation
- A double Metropolis–Hastings sampler for spatial models with intractable normalizing constants
- Advanced Markov Chain Monte Carlo Methods
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- The Multiple-Try Method and Local Optimization in Metropolis Sampling
- Equation of State Calculations by Fast Computing Machines
- On estimation in binary autologistic spatial models
- Classification of binary random patterns
- Monte Carlo sampling methods using Markov chains and their applications
- Multipoint Metropolis method with application to hybrid Monte Carlo