Issues in the multiple try Metropolis mixing
DOI10.1007/s00180-016-0643-9zbMath1417.65015DBLPjournals/cstat/MartinoL17arXiv1508.04253OpenAlexW2126184251WikidataQ59427884 ScholiaQ59427884MaRDI QIDQ2358918
Francisco Louzada, Luca Martino
Publication date: 27 June 2017
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.04253
MCMC methodsmulti-point Metropolis algorithmmultiple try Metropolis algorithmMTM with variable number of tries
Computational methods in Markov chains (60J22) Computational methods for problems pertaining to statistics (62-08) Bayesian inference (62F15) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- A multi-point Metropolis scheme with generic weight functions
- Interacting multiple try algorithms with different proposal distributions
- Scaling analysis of multiple-try MCMC methods
- On the flexibility of the design of multiple try Metropolis schemes
- Generalized multiple importance sampling
- Layered adaptive importance sampling
- Adaptive Multiple Importance Sampling
- Advanced Markov Chain Monte Carlo Methods
- The Multiple-Try Method and Local Optimization in Metropolis Sampling
- Safe and Effective Importance Sampling
- An Adaptive Population Importance Sampler: Learning From Uncertainty
- Equation of State Calculations by Fast Computing Machines
- Monte Carlo sampling methods using Markov chains and their applications
- Markov chain Monte Carlo methods with applications to signal processing.
- Multipoint Metropolis method with application to hybrid Monte Carlo
This page was built for publication: Issues in the multiple try Metropolis mixing