arXiv subjects

Thomas Goodwin

Publications and source records attributed to Thomas Goodwin.

4 recordsLinked to original sources

arXiv2026

Spectral subsampling MCMC for L\'evy-driven continuous-time ARMA models with expensive likelihood contributions

Subsampling-based Markov chain Monte Carlo (MCMC) algorithms aim to accelerate Bayesian inference by evaluating the likelihood using only a subset of the data at each iteration. However, in many standard tall-data applications, individual likelihood contributions are inexpensive to evaluate and the resulting reductions in actual computing time are often substantially smaller than the nominal reduction in data size due to computational overhead. We study a different computational regime arising in frequency-domain inference for continuous-time processes observed at equally spaced discrete time points. This gives rise to aliasing, whereby each contribution to the Whittle likelihood requires summation over shifted frequency components, unlike standard discrete-time spectral settings where spectral evaluations do not require such summation. We demonstrate that this structure makes subsampling MCMC, a subsampling-based MCMC approach that estimates the log-likelihood using data subsampling and efficient control variates, particularly effective for reducing computational cost. We illustrate the approach for Bayesian frequency-domain inference in discretely observed continuous-time autoregressive moving average models driven by finite second-moment L\'evy processes.

stat.CO↗

arXiv2026

Stabilised weighted data subsampling for accelerated inference in models with recursive likelihoods

Inference for models with recursively defined likelihoods is computationally demanding, limiting scalability to large datasets. We propose a stabilised weighted subsampling methodology for accelerated inference based on an unbiased estimator of the log-likelihood. By assigning higher sampling probabilities to early observations, the method reduces the effective depth of recursive likelihood evaluations and hence computational cost. However, sampling probabilities that decay too slowly yield limited savings, while overly aggressive decay can substantially inflate estimator variance. We develop a stabilisation framework, supported by theory, that restricts the decay to avoid both computational and variance pathologies through principled hyperparameter tuning. We also derive an unbiased subsampling estimator of the log-likelihood gradient, enabling gradient-based inference. The methodology can be embedded within a range of inferential frameworks. We illustrate its use in variational Bayes and subsampling Markov chain Monte Carlo for conditional volatility models, including leverage effects. Empirical results show substantial computational speed-ups relative to full-data methods while maintaining inferential accuracy. We also compare with recent stochastic gradient MCMC and divide-and-conquer MCMC methods for temporally dependent data, observing favourable empirical performance.

stat.ME↗

arXiv2025

Calibrated Bayesian inference for random fields on large irregular domains using the debiased spatial Whittle likelihood

Bayesian inference for stationary random fields is computationally demanding. Whittle-type likelihoods in the frequency domain based on the fast Fourier Transform (FFT) have several appealing features: i) low computational complexity of only $\mathcal{O}(n \log n)$, where $n$ is the number of spatial locations, ii) robustness to assumptions of the data-generating process, iii) ability to handle missing data and irregularly spaced domains, and iv) flexibility in modelling the covariance function via the spectral density directly in the spectral domain. It is well known, however, that the Whittle likelihood suffers from bias and low efficiency for spatial data. The debiased Whittle likelihood is a recently proposed alternative with better frequentist properties. We propose a methodology for Bayesian inference for stationary random fields using the debiased spatial Whittle likelihood, with an adjustment from the composite likelihood literature. The adjustment is shown to give a well-calibrated Bayesian posterior as measured by coverage properties of credible sets, without sacrificing the quasi-linear computation time. We apply the method to simulated data and two real datasets.

stat.ME↗

arXiv2024

Dynamic linear regression models for forecasting time series with semi long memory errors

Dynamic linear regression models forecast the values of a time series based on a linear combination of a set of exogenous time series while incorporating a time series process for the error term. This error process is often assumed to follow a stationary autoregressive integrated moving average (ARIMA) model, or its seasonal variants, which are unable to capture a long-range dependence structure (long memory) of the error process. We propose a novel dynamic linear regression model that incorporates the long-range dependence feature of the errors and show that the proposed error process may: (i) have a significant impact on the posterior uncertainty of the estimated regression parameters and (ii) improve the model's forecasting ability. We develop a Markov chain Monte Carlo method to fit general dynamic linear regression models based on a frequency domain approach that enables fast, asymptotically exact Bayesian inference for large datasets. We demonstrate that our approximate algorithm is faster than the traditional time domain approaches, such as the Kalman filter and the multivariate Gaussian likelihood, while producing a highly accurate approximation to the posterior. The method is illustrated in simulated examples and two energy forecasting applications, showing that it outperforms approaches that do not account for semi-long memory, as well as a state-of-the-art neural-network-based forecasting procedure.

stat.ME↗