Matthew A. Nunes

Matthew A. Nunes

Auto-generated profile, based on publicly available information

Matthew A. Nunes

Department of Mathematical Sciences University of Bath Bath UK

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
1 May 2013 in Statistical Science
Verified
Journal Article
Open access
PDF file
MBM. G. B. Blum
M. G. B. Blum
MNM. A. Nunes
M. A. Nunes
DPD. Prangle
D. Prangle
SSS. A. Sisson
S. A. Sisson
Approximate Bayesian computation (ABC) methods make use of comparisons between simulated and observed summary statistics to overcome the problem of computationally intractable likelihood functions. As the practical implementation of ABC requires computations based on vectors of summary statistics, rather than full data sets, a central question is how to derive low-dimensional summary statistics from the observed data with minimal loss of information. In this article we provide a comprehensive review and comparison of the performance of the principal methods of dimension reduction proposed in the ABC literature. The methods are split into three nonmutually exclusive classes consisting of best subset selection methods, projection techniques and regularization. In addition, we introduce two new methods of dimension reduction. The first is a best subset selection method based on Akaike and Bayesian information criteria, and the second uses ridge regression as a regularization procedure. We illustrate the performance of these dimension reduction techniques through the analysis of three challenging models and data sets.

6 September 2010 in Statistical Applications in Genetics and Molecular Biology
Verified
Journal Article
Closed access
MNMatthew A Nunes
Matthew A Nunes
DBDavid Balding
David Balding
How best to summarize large and complex datasets is a problem that arises in many areas of science. We approach it from the point of view of seeking data summaries that minimize the average squared error of the posterior distribution for a parameter of interest under approximate Bayesian computation (ABC). In ABC, simulation under the model replaces computation of the likelihood, which is convenient for many complex models. Simulated and observed datasets are usually compared using summary statistics, typically in practice chosen on the basis of the investigator's intuition and established practice in the field. We propose two algorithms for automated choice of efficient data summaries. Firstly, we motivate minimisation of the estimated entropy of the posterior approximation as a heuristic for the selection of summary statistics. Secondly, we propose a two-stage procedure: the minimum-entropy algorithm is used to identify simulated datasets close to that observed, and these are each successively regarded as observed datasets for which the mean root integrated squared error of the ABC posterior approximation is minimized over sets of summary statistics. In a simulation study, we both singly and jointly inferred the scaled mutation and recombination parameters from a population sample of DNA sequences. The computationally-fast minimum entropy algorithm showed a modest improvement over existing methods while our two-stage procedure showed substantial and highly-significant further improvement for both univariate and bivariate inferences. We found that the optimal set of summary statistics was highly dataset specific, suggesting that more generally there may be no globally-optimal choice, which argues for a new selection for each dataset even if the model and target of inference are unchanged.

10 June 2020 in PLOS ONE
Verified
Journal Article
Open access
PDF file
RMRicardo Pio Monti
Ricardo Pio Monti
AGAlex Gibberd
Alex Gibberd
SRSandipan Roy
Sandipan Roy
MNMatthew Nunes
Matthew Nunes
RLRomy Lorenz
Romy Lorenz
AHAapo Hyvärinen
Aapo Hyvärinen
Neuroimaging-driven prediction of brain age, defined as the predicted biological age of a subject using only brain imaging data, is an exciting avenue of research. In this work we seek to build models of brain age based on functional connectivity while prioritizing model interpretability and understanding. This way, the models serve to both provide accurate estimates of brain age as well as allow us to investigate changes in functional connectivity which occur during the ageing process. The methods proposed in this work consist of a two-step procedure: first, linear latent variable models, such as PCA and its extensions, are employed to learn reproducible functional connectivity networks present across a cohort of subjects. The activity within each network is subsequently employed as a feature in a linear regression model to predict brain age. The proposed framework is employed on the data from the CamCAN repository and the inferred brain age models are further demonstrated to generalize using data from two open-access repositories: the Human Connectome Project and the ATR Wide-Age-Range.

2 July 2011 in Statistics and Computing
Verified
Journal Article
Closed access
PDF file
MKMarina I. Knight
Marina I. Knight
MNMatthew A. Nunes
Matthew A. Nunes
GNGuy P. Nason
Guy P. Nason

3 September 2016 in Statistics and Computing
Verified
Journal Article
Open access
PDF file
MKMarina I. Knight
Marina I. Knight
GNGuy P. Nason
Guy P. Nason
MNMatthew A. Nunes
Matthew A. Nunes
Reliable estimation of long-range dependence parameters is vital in time series. For example, in environmental and climate science such estimation is often key to understanding climate dynamics, variability and often prediction. The challenge of data collection in such disciplines means that, in practice, the sampling pattern is either irregular or blighted by missing observations. Unfortunately, virtually all existing Hurst parameter estimation methods assume regularly sampled time series and require modification to cope with irregularity or missing data. However, such interventions come at the price of inducing higher estimator bias and variation, often worryingly ignored. This article proposes a new Hurst exponent estimation method which naturally copes with data sampling irregularity. The new method is based on a multiscale lifting transform exploiting its ability to produce wavelet-like coefficients on irregular data and, simultaneously, to effect a necessary powerful decorrelation of those coefficients. Simulations show that our method is accurate and effective, performing well against competitors even in regular data settings. Armed with this evidence our method sheds new light on long-memory intensity results in environmental and climate science applications, sometimes suggesting that different scientific conclusions may need to be drawn.

1 June 2006 in Statistics and Computing
Verified
Journal Article
Closed access
PDF file
MNMatthew A. Nunes
Matthew A. Nunes
MKMarina I. Knight
Marina I. Knight
GNGuy P. Nason
Guy P. Nason