A multi-point Metropolis scheme with generic weight functions
From MaRDI portal
Publication:449426
DOI10.1016/j.spl.2012.04.008zbMath1315.65004arXiv1112.4048OpenAlexW2097397563WikidataQ59428116 ScholiaQ59428116MaRDI QIDQ449426
Luca Martino, Jesse Read, Victor Pascual Del Olmo
Publication date: 30 August 2012
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.4048
Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40)
Related Items
Issues in the multiple try Metropolis mixing, Marginal Likelihood Computation for Model Selection and Hypothesis Testing: An Extensive Review, Compressed Monte Carlo with application in particle filtering, Parallel generalized elliptical slice sampling with adaptive regional pseudo-priors, A generalized multiple-try version of the reversible jump algorithm, Improving the acceptance in Monte Carlo simulations: sampling through intermediate states, Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm, On the flexibility of the design of multiple try Metropolis schemes, Generalized multiple-point Metropolis algorithms for approximate Bayesian computation, A multiple-try Metropolis-Hastings algorithm with tailored proposals
Cites Work
- Unnamed Item
- Unnamed Item
- Interacting multiple try algorithms with different proposal distributions
- On the ergodicity properties of some adaptive MCMC algorithms
- On the Flexibility of Metropolis-Hastings Acceptance Probabilities in Auxiliary Variable Proposal Generation
- Advanced Markov Chain Monte Carlo Methods
- The Multiple-Try Method and Local Optimization in Metropolis Sampling
- Equation of State Calculations by Fast Computing Machines
- Monte Carlo sampling methods using Markov chains and their applications
- Multipoint Metropolis method with application to hybrid Monte Carlo