2018
DOI: 10.1080/10618600.2018.1497511
|View full text |Cite
|
Sign up to set email alerts
|

Improving Approximate Bayesian Computation via Quasi-Monte Carlo

Abstract: ABC (approximate Bayesian computation) is a general approach for dealing with models with an intractable likelihood. In this work, we derive ABC algorithms based on QMC (quasi-Monte Carlo) sequences. We show that the resulting ABC estimates have a lower variance than their Monte Carlo counter-parts. We also develop QMC variants of sequential ABC algorithms, which progressively adapt the proposal distribution and the acceptance threshold. We illustrate our QMC approach through several examples taken from the AB… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(14 citation statements)
references
References 37 publications
(48 reference statements)
0
14
0
Order By: Relevance
“…The (in some cases) optimal convergence rates, as well as sound statistical properties, of QMC have recently led to interest within statistics (e.g. Gerber and Chopin, 2015;Buchholz and Chopin, 2017). A related method with non-uniform weights was explored in Stein (1995a,b).…”
Section: Monte Carlo Methodsmentioning
confidence: 99%
“…The (in some cases) optimal convergence rates, as well as sound statistical properties, of QMC have recently led to interest within statistics (e.g. Gerber and Chopin, 2015;Buchholz and Chopin, 2017). A related method with non-uniform weights was explored in Stein (1995a,b).…”
Section: Monte Carlo Methodsmentioning
confidence: 99%
“…, S}, the function E[ψ(y s i (θ), x i )|ũ s i = u] does not depend on x so that Theorem 1 can be applied to this conditional expectation, assuming it has finite variance. This insight was used to derive CLTs for moments based on hybrid sequences which combine MC draws with qMC sequences in Ökten et al (2006) and Buchholz and Chopin (2017) for bounded ψ. The results in Proposition 2 extend these results to unbounded empirical processes over θ ∈ Θ, allowing ψs n to be non-smooth in θ.…”
Section: Algorithm 1 Simulated Methods Of Moments For Static Modelsmentioning
confidence: 99%
“…These sequences were initially designed to compute integrals of iid sequences and can achieve faster than √ nrate convergence. More details are given in Section 2. qMC integration has been extended to non-linear state-space filtering (Gerber andChopin, 2015, 2017), MCMC sampling (Owen and Tribble, 2005) and importance sampling for ABC estimation (Buchholz and Chopin, 2017). A key takeaway from these papers is that a lot of care is required in implementing qMC integration in non iid settings (MCMC or filtering) where 'naive' implementations may be inconsistent.…”
Section: Related Literaturesmentioning
confidence: 99%
“…As a result, this strategy helps to reduce the variance in the outer sampling. Buchholz and Chopin [3] applied this strategy in ABC. They found that the resulting ABC estimate has a lower variance than the MC counter-part.…”
Section: (B)mentioning
confidence: 99%