Anthony Lee

Anthony Lee

Auto-generated profile, based on publicly available information

Anthony Lee

School of Mathematics, University of Bristol

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2010 in Journal of Computational and Graphical Statistics
Verified
Journal Article
Closed access
ALAnthony Lee
Anthony Lee
CYChristopher Yau
Christopher Yau
MGMichael B. Giles
Michael B. Giles
ADArnaud Doucet
Arnaud Doucet
CHChristopher C. Holmes
Christopher C. Holmes
We present a case study on the utility of graphics cards to perform massively parallel simulation of advanced Monte Carlo methods. Graphics cards, containing multiple Graphics Processing Units (GPU...

31 July 2017 in Journal of Computational and Graphical Statistics
Verified
Journal Article
Closed access
LPL. F. Price
L. F. Price
CDChristopher Drovandi
Christopher Drovandi
ALA. Lee
A. Lee
DND. J. Nott
D. J. Nott
Having the ability to work with complex models can be highly beneficial. However, complex models often have intractable likelihoods, so methods that involve evaluation of the likelihood function are infeasible. In these situations, the benefits of working with likelihood-free methods become apparent. Likelihood-free methods, such as parametric Bayesian indirect likelihood that uses the likelihood of an alternative parametric auxiliary model, have been explored throughout the literature as a viable alternative when the model of interest is complex. One of these methods is called the synthetic likelihood (SL), which uses a multivariate normal approximation of the distribution of a set of summary statistics. This article explores the accuracy and computational efficiency of the Bayesian version of the synthetic likelihood (BSL) approach in comparison to a competitor known as approximate Bayesian computation (ABC) and its sensitivity to its tuning parameters and assumptions. We relate BSL to pseudo-marginal methods and propose to use an alternative SL that uses an unbiased estimator of the SL, when the summary statistics have a multivariate normal distribution. Several applications of varying complexity are considered to illustrate the findings of this article. Supplemental materials are available online. Computer code for implementing the methods on all examples is available at https://github.com/cdrovandi/Bayesian-Synthetic-Likelihood.

2 July 2016 in Journal of Computational and Graphical Statistics
Verified
Journal Article
Closed access
LMLawrence M. Murray
Lawrence M. Murray
ALAnthony Lee
Anthony Lee
PJPierre Jacob
Pierre Jacob
Modern parallel computing devices, such as the graphics processing unit (GPU), have gained significant traction in scientific and statistical computing. They are particularly well-suited to data-parallel algorithms such as the particle filter, or more generally sequential Monte Carlo (SMC), which are increasingly used in statistical inference. SMC methods carry a set of weighted particles through repeated propagation, weighting, and resampling steps. The propagation and weighting steps are straightforward to parallelize, as they require only independent operations on each particle. The resampling step is more difficult, as standard schemes require a collective operation, such as a sum, across particle weights. Focusing on this resampling step, we analyze two alternative schemes that do not involve a collective operation (Metropolis and rejection resamplers), and compare them to standard schemes (multinomial, stratified, and systematic resamplers). We find that, in certain circumstances, the alternative resamplers can perform significantly faster on a GPU, and to a lesser extent on a CPU, than the standard approaches. Moreover, in single precision, the standard approaches are numerically biased for upward of hundreds of thousands of particles, while the alternatives are not. This is particularly important given greater single- than double-precision throughput on modern devices, and the consequent temptation to use single precision with a greater number of particles. Finally, we provide auxiliary functions useful for implementation, such as for the permutation of ancestry vectors to enable in-place propagation. Supplementary materials are available online.

18 July 2017 in Journal of the American Statistical Association
Verified
Journal Article
Open access
PGPieralberto Guarniero
Pieralberto Guarniero
AJAdam M. Johansen
Adam M. Johansen
ALAnthony Lee
Anthony Lee
We present an offline, iterated particle filter to facilitate statistical inference in general state space hidden Markov models. Given a model and a sequence of observations, the associated marginal likelihood L is central to likelihood-based inference for unknown statistical parameters. We define a class of “twisted” models: each member is specified by a sequence of positive functions ψ and has an associated ψ-auxiliary particle filter that provides unbiased estimates of L. We identify a sequence ψ* that is optimal in the sense that the ψ*-auxiliary particle filter’s estimate of L has zero variance. In practical applications, ψ* is unknown so the ψ*-auxiliary particle filter cannot straightforwardly be implemented. We use an iterative scheme to approximate ψ* and demonstrate empirically that the resulting iterated auxiliary particle filter significantly outperforms the bootstrap particle filter in challenging settings. Applications include parameter estimation using a particle Markov chain Monte Carlo algorithm.

1 February 2015 in Statistical Science
Verified
Journal Article
Open access
PDF file
CDChristopher Drovandi
Christopher Drovandi
APAnthony Pettitt
Anthony Pettitt
ALAnthony Lee
Anthony Lee
Indirect inference (II) is a methodology for estimating the parameters of an intractable (generative) model on the basis of an alternative parametric (auxiliary) model that is both analytically and computationally easier to deal with. Such an approach has been well explored in the classical literature but has received substantially less attention in the Bayesian paradigm. The purpose of this paper is to compare and contrast a collection of what we call parametric Bayesian indirect inference (pBII) methods. One class of pBII methods uses approximate Bayesian computation (referred to here as ABC II) where the summary statistic is formed on the basis of the auxiliary model, using ideas from II. Another approach proposed in the literature, referred to here as parametric Bayesian indirect likelihood (pBIL), uses the auxiliary likelihood as a replacement to the intractable likelihood. We show that pBIL is a fundamentally different approach to ABC II. We devise new theoretical results for pBIL to give extra insights into its behaviour and also its differences with ABC II. Furthermore, we examine in more detail the assumptions required to use each pBII method. The results, insights and comparisons developed in this paper are illustrated on simple examples and two other substantive applications. The first of the substantive examples involves performing inference for complex quantile distributions based on simulated data while the second is for estimating the parameters of a trivariate stochastic process describing the evolution of macroparasites within a host based on real data. We create a novel framework called Bayesian indirect likelihood (BIL) that encompasses pBII as well as general ABC methods so that the connections between the methods can be established.

1 May 2018 in Bernoulli
Verified
Journal Article
Closed access
PDF file
CAChristophe Andrieu
Christophe Andrieu
ALAnthony Lee
Anthony Lee
MVMatti Vihola
Matti Vihola
Project Euclid - mathematics and statistics online