Tutorial Session B – Approximate Bayesian Computation (ABC)

Approximate Bayesian computation (ABC) algorithms are a class of Monte Carlo methods for doing inference when the likelihood function can be simulated from, but not explicitly evaluated. This situation commonly occurs when using even relatively simple stochastic models. The algorithms can be viewed as methods for combining the scientific knowledge encoded in a computer model, with the empirical information contained in the data. The methods have become popular in the biological sciences, particularly in fields such as genetics and systematic biology, as they are simple to apply, and can be used on nearly any problem.

However, there are several problems with ABC algorithms: they can be inefficient if applied naively; they only give approximate answers with the quality of the approximation unknown; they rely on a vector of summary statistics that is difficult to choose. In the first part of this tutorial, I will introduce the basic ideas behind ABC algorithms and illustrate their use on a problem from climate science. In the second part, I will describe some of the recent advances in ABC research, including regression adjustment methods, automatic summary selection, and the use of generalized acceptance kernels.

Speaker Details

Richard Wilkinson is a lecturer of statistics at Nottingham University. He received his PhD in mathematics from the University of Cambridge in 2008, for work on ABC methods under the supervision of Simon Tavare. From 2007-2009 he was a postdoctoral researcher at the University of Sheffield working on methodology for uncertainty quantification (UQ) using Gaussian processes. His primary research is on Monte Carlo approaches to Bayesian inference, and UQ methods for complex computer experiments. He has worked in a range of application areas, including evolutionary biology and climate science.

Richard Wilkinson
The University of Nottingham
    • Portrait of Jeff Running

      Jeff Running