Generalized multiple-point Metropolis algorithms for approximate Bayesian computation
From MaRDI portal
Recommendations
- An adaptive sequential Monte Carlo method for approximate Bayesian computation
- Adaptive approximate Bayesian computation for complex models
- Adaptive approximate Bayesian computation
- Recent developments in approximate Bayesian computation samplers
- A new approach to choose acceptance cutoff for approximate Bayesian computation
Cites work
- A multi-point Metropolis scheme with generic weight functions
- a study of the generalized tukey lambda family
- Adaptive approximate Bayesian computation
- An adaptive sequential Monte Carlo method for approximate Bayesian computation
- Approximate Bayesian computational methods
- Estimation of parameters for macroparasite population evolution using approximate Bayesian computation
- Fitting statistical distributions. The generalized lambda distribution and generalized bootstrap methods
- Inference for Stereological Extremes
- Interacting multiple try algorithms with different proposal distributions
- Likelihood-free Bayesian inference for \(\alpha\)-stable models
- Likelihood-free MCMC
- Likelihood-free parallel tempering
- Markov chain Monte Carlo. Stochastic simulation for Bayesian inference.
- Monte Carlo strategies in scientific computing
- Multipoint Metropolis method with application to hybrid Monte Carlo
- Regression models for data with a non-zero probability of a zero response
- Sequential Monte Carlo without likelihoods
- The Multiple-Try Method and Local Optimization in Metropolis Sampling
Cited in
(2)
This page was built for publication: Generalized multiple-point Metropolis algorithms for approximate Bayesian computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220747)
