Corpus ID: 220055716

Robust and Efficient Approximate Bayesian Computation: A Minimum Distance Approach

  title={Robust and Efficient Approximate Bayesian Computation: A Minimum Distance Approach},
  author={David T. Frazier},
  journal={arXiv: Methodology},
  • David T. Frazier
  • Published 2020
  • Computer Science, Mathematics, Economics
  • arXiv: Methodology
In many instances, the application of approximate Bayesian methods is hampered by two practical features: 1) the requirement to project the data down to low-dimensional summary, including the choice of this projection, which ultimately yields inefficient inference; 2) a possible lack of robustness to deviations from the underlying model structure. Motivated by these efficiency and robustness concerns, we construct a new Bayesian method that can deliver efficient estimators when the underlying… Expand

Figures and Tables from this paper

Robust Generalised Bayesian Inference for Intractable Likelihoods
Generalised Bayesian inference updates prior beliefs using a loss function, rather than a likelihood, and can therefore be used to confer robustness against possible misspecification of theExpand
Robust adaptive distance functions for approximate Bayesian inference on outlier-corrupted data
Self-tuned outlier-insensitive distance functions are introduced, based on a popular adaptive distance weighting concept, complemented by a simulation-based online outlier detection and downweighting routine. Expand
A Comparison of Likelihood-Free Methods With and Without Summary Statistics
Likelihood-free methods are useful for parameter estimation of complex models with intractable likelihood functions for which it is easy to simulate data. Such models are prevalent in manyExpand
Generalized Bayesian Likelihood-Free Inference Using Scoring Rules Estimators
We propose a framework for Bayesian Likelihood-Free Inference (LFI) based on Generalized Bayesian Inference. To define the generalized posterior, we use Scoring Rules (SRs), which evaluateExpand
Computing Bayes: Bayesian Computation from 1763 to the 21st Century
This paper takes the reader on a chronological tour of Bayesian computation over the past two and a half centuries, and place all computational problems into a common framework, and describe all computational methods using a common notation. Expand


Robust Bayesian Inference via Coarsening
This work introduces a novel approach to Bayesian inference that improves robustness to small departures from the model: rather than conditioning on the event that the observed data are generated by the model, one conditions on theevent that the model generates data close to the observedData, in a distributional sense. Expand
Non-linear regression models for Approximate Bayesian Computation
A machine-learning approach to the estimation of the posterior density by introducing two innovations that fits a nonlinear conditional heteroscedastic regression of the parameter on the summary statistics, and then adaptively improves estimation using importance sampling. Expand
On the Asymptotic Efficiency of Approximate Bayesian Computation Estimators
Many statistical applications involve models for which it is difficult to evaluate the likelihood, but from which it is relatively easy to sample. Approximate Bayesian computation is aExpand
Constructing summary statistics for approximate Bayesian computation: semi-automatic approximate Bayesian computation (with Discussion)
This work shows how to construct appropriate summary statistics for ABC in a semi-automatic manner, and shows that optimal summary statistics are the posterior means of the parameters. Expand
Approximate Bayesian computation with the Wasserstein distance
This work proposes to avoid the use of summaries and the ensuing loss of information by instead using the Wasserstein distance between the empirical distributions of the observed and synthetic data, and generalizes the well‐known approach of using order statistics within approximate Bayesian computation to arbitrary dimensions. Expand
Likelihood-free Bayesian estimation of multivariate quantile distributions
A sequential Monte Carlo (SMC) algorithm is applied that is adaptive in nature and requires very little tuning compared with other approximate Bayesian computation algorithms, and a framework for the development of multivariate quantile distributions based on a copula is presented. Expand
Asymptotic properties of approximate Bayesian computation
Summary Approximate Bayesian computation allows for statistical analysis using models with intractable likelihoods. In this paper we consider the asymptotic behaviour of the posterior distributionExpand
Model misspecification in approximate Bayesian computation: consequences and diagnostics
We analyse the behaviour of approximate Bayesian computation (ABC) when the model generating the simulated data differs from the actual data‐generating process, i.e. when the data simulator in ABC isExpand
An adaptive sequential Monte Carlo method for approximate Bayesian computation
An adaptive SMC algorithm is proposed which admits a computational complexity that is linear in the number of samples and adaptively determines the simulation parameters. Expand
Bayesian Analysis of Stochastic Volatility Models
New techniques for the analysis of stochastic volatility models in which the logarithm of conditional variance follows an autoregressive model are developed. A cyclic Metropolis algorithm is used toExpand