Aidan Boland

Aidan Boland

Auto-generated profile, based on publicly available information

Aidan Boland

University College Dublin

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
10 December 2014 in Statistics and Computing
Verified
Journal Article
Closed access
PDF file
Pierre AlquierPierre Alquier
Pierre Alquier
NFN. Friel
N. Friel
RER. Everitt
R. Everitt
ABA. Boland
A. Boland

1 January 2018 in Electronic Journal of Statistics
Verified
Journal Article
Open access
PDF file
ABAidan Boland
Aidan Boland
NFNial Friel
Nial Friel
FMFlorian Maire
Florian Maire
Bayesian inference of Gibbs random fields (GRFs) is often referred to as a doubly intractable problem, since the normalizing constant of both the likelihood function and the posterior distribution are not in closed-form. The exploration of the posterior distribution of such models is typically carried out with a sophisticated Markov chain Monte Carlo (MCMC) method, the exchange algorithm [28], which requires simulations from the likelihood function at each iteration. The purpose of this paper is to consider an approach to dramatically reduce this computational overhead. To this end we introduce a novel class of algorithms which use realizations of the GRF model, simulated offline, at locations specified by a grid that spans the parameter space. This strategy speeds up dramatically the posterior inference, as illustrated on several examples. However, using the pre-computed graphs introduces a noise in the MCMC algorithm, which is no longer exact. We study the theoretical behaviour of the resulting approximate MCMC algorithm and derive convergence bounds using a recent theoretical development on approximate MCMC methods.