2011
DOI: 10.1007/s11222-011-9288-2
|View full text |Cite
|
Sign up to set email alerts
|

Approximate Bayesian computational methods

Abstract: Also known as likelihood-free methods, approximate Bayesian computational (ABC) methods have appeared in the past ten years as the most satisfactory approach to intractable likelihood problems, first in genetics then in a broader spectrum of applications. However, these methods suffer to some degree from calibration difficulties that make them rather volatile in their implementation and thus render them suspicious to the users of more traditional Monte Carlo methods. In this survey, we study the various improv… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
633
0
6

Year Published

2015
2015
2017
2017

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 670 publications
(639 citation statements)
references
References 49 publications
(95 reference statements)
0
633
0
6
Order By: Relevance
“…Whilet ij· is a biased approximation to t ij· , it appears that by having a similar bias in all treatment groups of a trial the bias often approximately cancels out when it comes to the estimation of the hazard ratio. Further alternatives include approximate Bayesian computations (Marin et al, 2012), which would avoid the need to derive and evaluate an AD likelihood.…”
Section: Discussionmentioning
confidence: 99%
“…Whilet ij· is a biased approximation to t ij· , it appears that by having a similar bias in all treatment groups of a trial the bias often approximately cancels out when it comes to the estimation of the hazard ratio. Further alternatives include approximate Bayesian computations (Marin et al, 2012), which would avoid the need to derive and evaluate an AD likelihood.…”
Section: Discussionmentioning
confidence: 99%
“…ABC comprises several simulation-based methods to obtain samples from the posterior distribution when the likelihood function is not known (for review papers, see, e.g., Lintusaari et al 2017;Marin et al 2012). ABC algorithms are iterative: The basic steps at each iteration are as follows:…”
Section: Bayesian Inference Via Classificationmentioning
confidence: 99%
“…Both the distance function used and the summary statistics are critical for the success of the inference procedure (see, for example, the reviews by Lintusaari et al (2017) and Marin et al (2012). Traditionally, researchers choose the two quantities subjectively, relying on expert knowledge about the observed data.…”
Section: Introductionmentioning
confidence: 99%
“…To remedy this situation, the ABC filters 20,21,25,30 provide the point-mass approximation (21) of the target density π(ξ 1:k |y 1:k ) using a different strategy. The Monte Carlo samples ξ (i) k , i = 1, … , I drawn from the state space are directly plugged into the observation model (19).…”
Section: Approximate Filteringmentioning
confidence: 99%
“…[16][17][18][19] The generic ABC filter 20 is not an exception in this respect. As a result, it has attractive asymptotic properties ensuring convergence to the true state value, however, at the cost of rather impractical assumptions 21 requiring carefully designed adaptation of the kernel scale, eg, using a linear schedule 22 or effective sample size-based scale contraction. 23,24 An alternative method partially solving these issues is inspired by the kernel density estimation (KDE) theory.…”
Section: Introductionmentioning
confidence: 99%