A simulated annealing approach to approximate Bayes computations
From MaRDI portal
Publication:5963821
Abstract: Approximate Bayes Computations (ABC) are used for parameter inference when the likelihood function of the model is expensive to evaluate but relatively cheap to sample from. In particle ABC, an ensemble of particles in the product space of model outputs and parameters is propagated in such a way that its output marginal approaches a delta function at the data and its parameter marginal approaches the posterior distribution. Inspired by Simulated Annealing, we present a new class of particle algorithms for ABC, based on a sequence of Metropolis kernels, associated with a decreasing sequence of tolerances w.r.t. the data. Unlike other algorithms, our class of algorithms is not based on importance sampling. Hence, it does not suffer from a loss of effective sample size due to re-sampling. We prove convergence under a condition on the speed at which the tolerance is decreased. Furthermore, we present a scheme that adapts the tolerance and the jump distribution in parameter space according to some mean-fields of the ensemble, which preserves the statistical independence of the particles, in the limit of infinite sample size. This adaptive scheme aims at converging as close as possible to the correct result with as few system updates as possible via minimizing the entropy production in the system. The performance of this new class of algorithms is compared against two other recent algorithms on two toy examples.
Recommendations
- Adaptive approximate Bayesian computation for complex models
- An adaptive sequential Monte Carlo method for approximate Bayesian computation
- Adaptive approximate Bayesian computation tolerance selection
- The rate of convergence for approximate Bayesian computation
- Approximate Bayesian computation by subset simulation
Cites work
- scientific article; zbMATH DE number 4211245 (Why is no real title available?)
- scientific article; zbMATH DE number 3723140 (Why is no real title available?)
- Adaptive approximate Bayesian computation
- Adaptive approximate Bayesian computation for complex models
- An adaptive sequential Monte Carlo method for approximate Bayesian computation
- Approximate Bayesian computational methods
- Constructing summary statistics for approximate Bayesian computation: semi-automatic approximate Bayesian computation. With discussion and authors' reply
- Disturbance attenuation and trajectory tracking via a reduced-order output feedback controller for robot manipulators
- Equation of state calculations by fast computing machines
- On the stability of sequential Monte Carlo methods in high dimensions
- Quantitative bounds on convergence of time-inhomogeneous Markov chains
- Reciprocal Relations in Irreversible Processes. I.
- École d'été de probabilités de Saint-Flour XV-XVII, 1985-87 (2-19 Juil. 1985, 17 Août - 3 Sept. 1986, 1-18 Juil. 1987)
Cited in
(8)- Bayesian inference of spreading processes on networks
- An approximate likelihood perspective on ABC methods
- Distance-learning for approximate Bayesian computation to model a volcanic eruption
- Adaptive approximate Bayesian computation for complex models
- scientific article; zbMATH DE number 218213 (Why is no real title available?)
- scientific article; zbMATH DE number 7625191 (Why is no real title available?)
- Simulated annealing in compound Gaussian random fields (image processing)
- Approximate Bayesian inference for simulation and optimization
This page was built for publication: A simulated annealing approach to approximate Bayes computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963821)
