A Comparison of Kernels for ABC-SMC

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Prangle, Dennis, Viscardi, Cecilia, Ragy, Sammy
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866914144157958144
author Prangle, Dennis
Viscardi, Cecilia
Ragy, Sammy
author_facet Prangle, Dennis
Viscardi, Cecilia
Ragy, Sammy
contents A popular method for likelihood-free inference is approximate Bayesian computation sequential Monte Carlo (ABC-SMC) algorithms. These approximate the posterior using a population of particles, which are updated using Markov kernels. Several such kernels have been proposed. In this paper we review these, highlighting some less well known choices, and proposing some novel options. Further, we conduct an extensive empirical comparison of kernel choices. Our results suggest using a one-hit kernel with a mixture proposal as a default choice.
format Preprint
id arxiv_https___arxiv_org_abs_2511_06351
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A Comparison of Kernels for ABC-SMC
Prangle, Dennis
Viscardi, Cecilia
Ragy, Sammy
Computation
A popular method for likelihood-free inference is approximate Bayesian computation sequential Monte Carlo (ABC-SMC) algorithms. These approximate the posterior using a population of particles, which are updated using Markov kernels. Several such kernels have been proposed. In this paper we review these, highlighting some less well known choices, and proposing some novel options. Further, we conduct an extensive empirical comparison of kernel choices. Our results suggest using a one-hit kernel with a mixture proposal as a default choice.
title A Comparison of Kernels for ABC-SMC
topic Computation
url https://arxiv.org/abs/2511.06351