Non-linear regression models for Approximate Bayesian Computation

  title={Non-linear regression models for Approximate Bayesian Computation},
  author={Michael G. B. Blum and Olivier François},
  journal={Statistics and Computing},
  • M. Blum, O. François
  • Published 24 September 2008
  • Mathematics, Computer Science
  • Statistics and Computing
Approximate Bayesian inference on the basis of summary statistics is well-suited to complex problems for which the likelihood is either mathematically or computationally intractable. However the methods that use rejection suffer from the curse of dimensionality when the number of summary statistics is increased. Here we propose a machine-learning approach to the estimation of the posterior density by introducing two innovations. The new method fits a nonlinear conditional heteroscedastic… Expand
Choosing summary statistics by least angle regression for approximate Bayesian computation
ABSTRACT Bayesian statistical inference relies on the posterior distribution. Depending on the model, the posterior can be more or less difficult to derive. In recent years, there has been a lot ofExpand
Approximate Bayesian computation
Bayesian statistics provides a principled framework for performing statistical inference for an unknown parameter of a stochastic model assumed to be responsible for generating some observed data.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
Piecewise Approximate Bayesian Computation: fast inference for discretely observed Markov models using a factorised posterior distribution
This work proposes a new “piecewise” ABC approach suitable for discretely observed Markov models that involves writing the posterior density of the parameters as a product of factors, each a function of only a subset of the data, and then using ABC within each factor. Expand
Approximate Bayesian Computation by Modelling Summary Statistics in a Quasi-likelihood Framework
Approximate Bayesian Computation (ABC) is a useful class of methods for Bayesian inference when the likelihood function is computationally intractable. In practice, the basic ABC algorithm may beExpand
DR-ABC: Approximate Bayesian Computation with Kernel-Based Distribution Regression
A novel framework is developed that model the functional relationship between data distributions and the optimal choice of summary statistics using kernel-based distribution regression and can be implemented in a computationally and statistically efficient way using the random Fourier features framework for large-scale kernel learning. Expand
Approximate Bayesian Computation: A Nonparametric Perspective
Approximate Bayesian Computation is a family of likelihood-free inference techniques that are well suited to models defined in terms of a stochastic generating mechanism. In a nutshell, ApproximateExpand
Fast Approximate Bayesian Computation for discretely observed Markov models using a factorised posterior distribution
Many modern statistical applications involve inference for complicated stochastic models for which the likelihood function is difficult or even impossible to calculate, and hence conventionalExpand
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 in population genetics.
A key advantage of the method is that the nuisance parameters are automatically integrated out in the simulation step, so that the large numbers of nuisance parameters that arise in population genetics problems can be handled without difficulty. Expand
Approximate Bayesian computation scheme for parameter inference and model selection in dynamical systems
This paper discusses and applies an ABC method based on sequential Monte Carlo (SMC) to estimate parameters of dynamical models and develops ABC SMC as a tool for model selection; given a range of different mathematical descriptions, it is able to choose the best model using the standard Bayesian model selection apparatus. Expand
Bayesian Data Analysis
Detailed notes on Bayesian Computation Basics of Markov Chain Simulation, Regression Models, and Asymptotic Theorems are provided. Expand
Monte Carlo Methods of Inference for Implicit Statistical Models
A prescribed statistical model is a parametric specification of the distribution of a random vector, whilst an implicit statistical model is one defined at a more fundamental level in terms of aExpand
Efficient Estimation of Conditional Variance Functions in Stochastic Regression
Conditional heteroscedasticity has been often used in modelling and understanding the variability of statistical data. Under a general setup which includes the nonlinear time series model as aExpand
Approximate Bayesian Computation for epidemiological models: Application to the Cuban HIV-AIDS epidemic with contact-tracing and unobserved infectious population
Statistical inference with missing data is a recurrent issue in epidemiology where the infection process is only partially observable. In this paper, Approximate Bayesian Computation, an alternativeExpand
ABC likelihood-free methods for model choice in Gibbs random fields
Gibbs random fields are polymorphous statistical models that can be used to analyse different types of dependence, in particular for spatially correlated data. However, when those models are facedExpand
Estimating functions in indirect inference
There are models for which the evaluation of the likelihood is infeasible in practice. For these models the Metropolis-Hastings acceptance probability cannot be easily computed. This is the case, forExpand
Integration within the Felsenstein equation for improved Markov chain Monte Carlo methods in population genetics
  • J. Hey, R. Nielsen
  • Computer Science, Medicine
  • Proceedings of the National Academy of Sciences
  • 2007
An approach in which Markov chain Monte Carlo simulations are used to integrate over the space of genealogies, whereas other parameters are integrated out analytically, resulting in an approximation to the full joint posterior density of the model parameters. Expand
Markov chain Monte Carlo without likelihoods
A Markov chain Monte Carlo method for generating observations from a posterior distribution without the use of likelihoods is presented, which can be used in frequentist applications, in particular for maximum-likelihood estimation. Expand