Generalized multiple-point Metropolis algorithms for approximate Bayesian computation
From MaRDI portal
Publication:5220747
DOI10.1080/00949655.2013.836652zbMath1457.62019OpenAlexW2041121812MaRDI QIDQ5220747
Publication date: 27 March 2020
Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00949655.2013.836652
Markov chain Monte Carloapproximate Bayesian computationgeneralized lambda distributionlikelihood free methodmultiple-point Metropolis
Computational methods for problems pertaining to statistics (62-08) Bayesian inference (62F15) Monte Carlo methods (65C05)
Uses Software
Cites Work
- A multi-point Metropolis scheme with generic weight functions
- An adaptive sequential Monte Carlo method for approximate Bayesian computation
- Approximate Bayesian computational methods
- Interacting multiple try algorithms with different proposal distributions
- Likelihood-free parallel tempering
- Likelihood-free Bayesian inference for \(\alpha\)-stable models
- Estimation of Parameters for Macroparasite Population Evolution Using Approximate Bayesian Computation
- a study of the generalized tukey lambda family
- Adaptive approximate Bayesian computation
- The Multiple-Try Method and Local Optimization in Metropolis Sampling
- Regression models for data with a non-zero probability of a zero response
- Inference for Stereological Extremes
- Sequential Monte Carlo without likelihoods
- Monte Carlo strategies in scientific computing
- Multipoint Metropolis method with application to hybrid Monte Carlo
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Generalized multiple-point Metropolis algorithms for approximate Bayesian computation
