Alex Gibberd
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Alex Gibberd has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
James D. B. Nelson
Department of Statistical Science, University College London, Bloomsbury, London, United Kingdom
4 shared publicationsLuke Mosley
Department of Mathematics and Statistics Lancaster University LA1 4YW Lancaster United Kingdom
3 shared publicationsJ. D. B. Nelson
University College
2 shared publications- Matthew A. Nunes
Department of Mathematical Sciences University of Bath Bath UK
2 shared publications Sandipan Roy
Claverton Down Campus: University of Bath
2 shared publications- Sandipan Roy
Department of Mathematical Sciences, University of Bath , Bath
2 shared publications
Latest Publications
- Open Access
- 20 November 2026
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series C: Applied Statistics
Identifying neural connectivity using Bernoulli autoregressive partially linear additive models
Characterizing the interactions between spiking neurons is central to our understanding of cognitive processes such as memory, perception, and decision making. In this work, we consider the problem of inferring connectivity in the brain network from non-stationary high-dimensional spike train data. Under a binned spike count representation of these data, we propose a Bernoulli autoregressive partially linear additive (BAPLA) model to identify the effective connectivity of a population of neurons. Estimates of the model parameters are obtained using a regularized maximum likelihood estimator, where an ℓ1 penalty is used to find sparse and interpretable estimates of neuronal interactions. We also account for non-stationary firing rates by adding a non-parametric trend to the model and propose an inference procedure to quantify the uncertainty associated with our estimated networks of neuronal interactions. We empirically validate the performance of the BAPLA method and the inferential procedure, highlighting its ability to detect both excitatory and inhibitory interactions in various settings. Finally, we apply our method to a neural spiking dataset from the distributed archives for neurophysiology data integration archive, where we study the interactions of neural processes in reaction to various stimulus-response type neuroscience experiments.
- 20 November 2026
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series C: Applied Statistics
Open AccessIdentifying neural connectivity using Bernoulli autoregressive partially linear additive models
Characterizing the interactions between spiking neurons is central to our understanding of cognitive processes such as memory, perception, and decision making. In this work, we consider the problem of inferring connectivity in the brain network from non-stationary high-dimensional spike train data. Under a binned spike count representation of these data, we propose a Bernoulli autoregressive partially linear additive (BAPLA) model to identify the effective connectivity of a population of neurons. Estimates of the model parameters are obtained using a regularized maximum likelihood estimator, where an ℓ1 penalty is used to find sparse and interpretable estimates of neuronal interactions. We also account for non-stationary firing rates by adding a non-parametric trend to the model and propose an inference procedure to quantify the uncertainty associated with our estimated networks of neuronal interactions. We empirically validate the performance of the BAPLA method and the inferential procedure, highlighting its ability to detect both excitatory and inhibitory interactions in various settings. Finally, we apply our method to a neural spiking dataset from the distributed archives for neurophysiology data integration archive, where we study the interactions of neural processes in reaction to various stimulus-response type neuroscience experiments.
- Open Access
Prediction of fMRI activity using vector autoregressive models: a comparison of sparse and low-rank approaches
Vector autoregressive (VAR) models have a history of being used to examine functional connectivity in the brain, as captured by functional MRI studies. Such models allow for an estimation of Granger-causal relationships between regions of interest across the brain. Unfortunately, since the number of parameters in the VAR model scales as the square of the number of regions, and this is typically large compared to the number of temporal observations, these parameter estimates will exhibit high variance. To address this challenge, we introduce a low-rank pre-smoothing method that applies a low-rank approximation to the observations before fitting a VAR model. We estimate these models using individual subject data from both task-based and resting-state conditions, tuning hyper-parameters at the population level. Our low-rank approach is directly compared against sparse and unconstrained estimation methods. Evaluations of predictive performance and model structure reveal that our pre-smoothing technique enables robust individual-level parameter estimation and significantly reduces prediction error, a finding further validated by synthetic experiments where the ground-truth parameters are known.
Open AccessPrediction of fMRI activity using vector autoregressive models: a comparison of sparse and low-rank approaches
Vector autoregressive (VAR) models have a history of being used to examine functional connectivity in the brain, as captured by functional MRI studies. Such models allow for an estimation of Granger-causal relationships between regions of interest across the brain. Unfortunately, since the number of parameters in the VAR model scales as the square of the number of regions, and this is typically large compared to the number of temporal observations, these parameter estimates will exhibit high variance. To address this challenge, we introduce a low-rank pre-smoothing method that applies a low-rank approximation to the observations before fitting a VAR model. We estimate these models using individual subject data from both task-based and resting-state conditions, tuning hyper-parameters at the population level. Our low-rank approach is directly compared against sparse and unconstrained estimation methods. Evaluations of predictive performance and model structure reveal that our pre-smoothing technique enables robust individual-level parameter estimation and significantly reduces prediction error, a finding further validated by synthetic experiments where the ground-truth parameters are known.
- Open Access
- 20 April 2026
- Published by Wiley in Statistical Analysis and Data Mining: An ASA Data Science Journal
- Vol. 19 (2)
Large Multi‐Response Linear Regression Estimation Based on Low‐Rank Pre‐Smoothing
Pre‐smoothing is a technique aimed at increasing the signal‐to‐noise ratio in data to improve subsequent estimation and model selection in regression problems. However, pre‐smoothing has thus far been limited to the univariate response regression setting. However, there are many scientific applications in which interest lies in multi‐response regression problems, particularly when the number of responses is large. Motivated by this setting, this article proposes a technique for data pre‐smoothing based on low‐rank approximation. We establish theoretical results on the performance of the proposed methodology, which show that in this large‐response setting, the proposed technique outperforms ordinary least squares estimation with the mean squared error criterion, whilst being computationally more efficient than alternative approaches such as reduced rank regression. We quantify our estimator's benefit empirically in a number of simulated experiments. We also demonstrate our proposed low‐rank pre‐smoothing technique on real data arising from the environmental and biological sciences.
- 20 April 2026
- Published by Wiley in Statistical Analysis and Data Mining: An ASA Data Science Journal
- Vol. 19 (2)
Open AccessLarge Multi‐Response Linear Regression Estimation Based on Low‐Rank Pre‐Smoothing
Pre‐smoothing is a technique aimed at increasing the signal‐to‐noise ratio in data to improve subsequent estimation and model selection in regression problems. However, pre‐smoothing has thus far been limited to the univariate response regression setting. However, there are many scientific applications in which interest lies in multi‐response regression problems, particularly when the number of responses is large. Motivated by this setting, this article proposes a technique for data pre‐smoothing based on low‐rank approximation. We establish theoretical results on the performance of the proposed methodology, which show that in this large‐response setting, the proposed technique outperforms ordinary least squares estimation with the mean squared error criterion, whilst being computationally more efficient than alternative approaches such as reduced rank regression. We quantify our estimator's benefit empirically in a number of simulated experiments. We also demonstrate our proposed low‐rank pre‐smoothing technique on real data arising from the environmental and biological sciences.
- 1 January 2026
- Published by Institute of Mathematical Statistics in Electronic Journal of Statistics
- Vol. 20 (1) , 1666-1708
ℓ1-regularized generalized least squares
We study a simple ℓ1-regularized generalized least-squares (GLS) estimator for high-dimensional regressions with autocorrelated errors. The estimation procedure consists of three steps: performing a LASSO regression, fitting an autoregressive model to the realized residuals, and then running a second-stage LASSO regression on the rotated (whitened) data. We examine the theoretical performance of the method in a sub-Gaussian random-design setting, in particular assessing the impact of the rotation on the design matrix and how this impacts the estimation error of the procedure. We show that the GLS (and a feasible variant) maintains a smaller estimation error than an unadjusted LASSO regression when the errors are driven by an autoregressive process. A simulation study verifies the performance of the proposed method, demonstrating that the penalized (feasible) GLS-LASSO estimator performs on par with the LASSO in the case of white noise errors, whilst outperforming when the errors exhibit significant autocorrelation.
- 1 January 2026
- Published by Institute of Mathematical Statistics in Electronic Journal of Statistics
- Vol. 20 (1) , 1666-1708
ℓ1-regularized generalized least squares
We study a simple ℓ1-regularized generalized least-squares (GLS) estimator for high-dimensional regressions with autocorrelated errors. The estimation procedure consists of three steps: performing a LASSO regression, fitting an autoregressive model to the realized residuals, and then running a second-stage LASSO regression on the rotated (whitened) data. We examine the theoretical performance of the method in a sub-Gaussian random-design setting, in particular assessing the impact of the rotation on the design matrix and how this impacts the estimation error of the procedure. We show that the GLS (and a feasible variant) maintains a smaller estimation error than an unadjusted LASSO regression when the errors are driven by an autoregressive process. A simulation study verifies the performance of the proposed method, demonstrating that the penalized (feasible) GLS-LASSO estimator performs on par with the LASSO in the case of white noise errors, whilst outperforming when the errors exhibit significant autocorrelation.
- Open Access
- 1 December 2024
- Published by The R Foundation in The R Journal
- Vol. 16 (4) , 62-73
Disaggregating Time-Series with Many Indicators: An Overview of the DisaggregateTS Package
- 1 December 2024
- Published by The R Foundation in The R Journal
- Vol. 16 (4) , 62-73
Open AccessDisaggregating Time-Series with Many Indicators: An Overview of the DisaggregateTS Package
- Open Access
- 22 August 2024
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 201
Feasible model-based principal component analysis: Joint estimation of rank and error covariance matrix
- 22 August 2024
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 201
Open AccessFeasible model-based principal component analysis: Joint estimation of rank and error covariance matrix
- Open Access
- 22 January 2024
- Published by Springer Nature in Statistics and Computing
- Vol. 34 (2) , 1-19
The sparse dynamic factor model: a regularised quasi-maximum likelihood approach
The concepts of sparsity, and regularised estimation, have proven useful in many high-dimensional statistical applications. Dynamic factor models (DFMs) provide a parsimonious approach to modelling high-dimensional time series, however, it is often hard to interpret the meaning of the latent factors. This paper formally introduces a class of sparse DFMs whereby the loading matrices are constrained to have few non-zero entries, thus increasing interpretability of factors. We present a regularised M-estimator for the model parameters, and construct an efficient expectation maximisation algorithm to enable estimation. Synthetic experiments demonstrate consistency in terms of estimating the loading structure, and superior predictive performance where a low-rank factor structure may be appropriate. The utility of the method is further illustrated in an application forecasting electricity consumption across a large set of smart meters.
- 22 January 2024
- Published by Springer Nature in Statistics and Computing
- Vol. 34 (2) , 1-19
Open AccessThe sparse dynamic factor model: a regularised quasi-maximum likelihood approach
The concepts of sparsity, and regularised estimation, have proven useful in many high-dimensional statistical applications. Dynamic factor models (DFMs) provide a parsimonious approach to modelling high-dimensional time series, however, it is often hard to interpret the meaning of the latent factors. This paper formally introduces a class of sparse DFMs whereby the loading matrices are constrained to have few non-zero entries, thus increasing interpretability of factors. We present a regularised M-estimator for the model parameters, and construct an efficient expectation maximisation algorithm to enable estimation. Synthetic experiments demonstrate consistency in terms of estimating the loading structure, and superior predictive performance where a low-rank factor structure may be appropriate. The utility of the method is further illustrated in an application forecasting electricity consumption across a large set of smart meters.
- 7 July 2023
- Published by Elsevier in Journal of Empirical Finance
- Vol. 73, 220-237
When “time varying” volatility meets “transaction cost” in portfolio selection
- 7 July 2023
- Published by Elsevier in Journal of Empirical Finance
- Vol. 73, 220-237
When “time varying” volatility meets “transaction cost” in portfolio selection
- Open Access
sparseDFM: An R Package to Estimate Dynamic Factor Models with Sparse Loadings
sparseDFM is an R package for the implementation of popular estimation methods for dynamic factor models (DFMs) including the novel Sparse DFM approach of Mosley et al. (2023). The Sparse DFM ameliorates interpretability issues of factor structure in classic DFMs by constraining the loading matrices to have few non-zero entries (i.e. are sparse). Mosley et al. (2023) construct an efficient expectation maximisation (EM) algorithm to enable estimation of model parameters using a regularised quasi-maximum likelihood. We provide detail on the estimation strategy in this paper and show how we implement this in a computationally efficient way. We then provide two real-data case studies to act as tutorials on how one may use the sparseDFM package. The first case study focuses on summarising the structure of a small subset of quarterly CPI (consumer price inflation) index data for the UK, while the second applies the package onto a large-scale set of monthly time series for the purpose of nowcasting nine of the main trade commodities the UK exports worldwide.
Open AccesssparseDFM: An R Package to Estimate Dynamic Factor Models with Sparse Loadings
sparseDFM is an R package for the implementation of popular estimation methods for dynamic factor models (DFMs) including the novel Sparse DFM approach of Mosley et al. (2023). The Sparse DFM ameliorates interpretability issues of factor structure in classic DFMs by constraining the loading matrices to have few non-zero entries (i.e. are sparse). Mosley et al. (2023) construct an efficient expectation maximisation (EM) algorithm to enable estimation of model parameters using a regularised quasi-maximum likelihood. We provide detail on the estimation strategy in this paper and show how we implement this in a computationally efficient way. We then provide two real-data case studies to act as tutorials on how one may use the sparseDFM package. The first case study focuses on summarising the structure of a small subset of quarterly CPI (consumer price inflation) index data for the UK, while the second applies the package onto a large-scale set of monthly time series for the purpose of nowcasting nine of the main trade commodities the UK exports worldwide.
- Open Access
The Sparse Dynamic Factor Model: A Regularised Quasi-Maximum Likelihood Approach
The concepts of sparsity, and regularised estimation, have proven useful in many high-dimensional statistical applications. Dynamic factor models (DFMs) provide a parsimonious approach to modelling high-dimensional time series, however, it is often hard to interpret the meaning of the latent factors. This paper formally introduces a class of sparse DFMs whereby the loading matrices are constrained to have few non-zero entries, thus increasing interpretability of factors. We present a regularised M-estimator for the model parameters, and construct an efficient expectation maximisation algorithm to enable estimation. Synthetic experiments demonstrate consistency in terms of estimating the loading structure, and superior predictive performance where a low-rank factor structure may be appropriate. The utility of the method is further illustrated in an application forecasting electricity consumption across a large set of smart meters.
Open AccessThe Sparse Dynamic Factor Model: A Regularised Quasi-Maximum Likelihood Approach
The concepts of sparsity, and regularised estimation, have proven useful in many high-dimensional statistical applications. Dynamic factor models (DFMs) provide a parsimonious approach to modelling high-dimensional time series, however, it is often hard to interpret the meaning of the latent factors. This paper formally introduces a class of sparse DFMs whereby the loading matrices are constrained to have few non-zero entries, thus increasing interpretability of factors. We present a regularised M-estimator for the model parameters, and construct an efficient expectation maximisation algorithm to enable estimation. Synthetic experiments demonstrate consistency in terms of estimating the loading structure, and superior predictive performance where a low-rank factor structure may be appropriate. The utility of the method is further illustrated in an application forecasting electricity consumption across a large set of smart meters.