Online Spectral Density Estimation
By: Shahriar Hasnat Kazi, Niall Adams, Edward A. K. Cohen
Potential Business Impact:
Tracks changing patterns in data as they happen.
This paper develops the first online algorithms for estimating the spectral density function -- a fundamental object of interest in time series analysis -- that satisfies the three core requirements of streaming inference: fixed memory, fixed computational complexity, and temporal adaptivity. Our method builds on the concept of forgetting factors, allowing the estimator to adapt to gradual or abrupt changes in the data-generating process without prior knowledge of its dynamics. We introduce a novel online forgetting-factor periodogram and show that, under stationarity, it asymptotically recovers the properties of its offline counterpart. Leveraging this, we construct an online Whittle estimator, and further develop an adaptive online spectral estimator that dynamically tunes its forgetting factor using the Whittle likelihood as a loss. Through extensive simulation studies and an application to ocean drifter velocity data, we demonstrate the method's ability to track time-varying spectral properties in real-time with strong empirical performance.
Similar Papers
Nonparametric spectral density estimation from irregularly sampled data
Methodology
Find patterns in messy, scattered data.
Filtering of periodically correlated processes
Statistics Theory
Finds best guesses for hidden signals in noisy data.
Statistical Theory of Multi-stage Newton Iteration Algorithm for Online Continual Learning
Methodology
Teaches computers new things without forgetting old ones.