TY - GEN
T1 - A Gaussian Process-based Streaming Algorithm for Prediction of Time Series With Regimes and Outliers
AU - Waxman, Daniel
AU - Djurić, Petar M.
N1 - Publisher Copyright: © 2024 ISIF.
PY - 2024
Y1 - 2024
N2 - Online prediction of time series under regime switching is a widely studied problem in the literature, with many celebrated approaches. Using the non-parametric flexibility of Gaussian processes, the recently proposed INTEL algorithm provides a product of experts approach to online prediction of time series under possible regime switching, including the special case of outliers. This is achieved by adaptively combining several candidate models, each reporting their predictive distribution at time t. However, the INTEL algorithm uses a finite context window approximation to the predictive distribution, the computation of which scales cubically with the maximum lag, or otherwise scales quartically with exact predictive distributions. We introduce LINTEL, which uses the exact filtering distribution at time t with constant-time updates, making the time complexity of the streaming algorithm optimal. We additionally note that the weighting mechanism of INTEL is better suited to a mixture of experts approach, and propose a fusion policy based on arithmetic averaging for LINTEL. We show experimentally that our proposed approach is over five times faster than INTEL under reasonable settings with better quality predictions.
AB - Online prediction of time series under regime switching is a widely studied problem in the literature, with many celebrated approaches. Using the non-parametric flexibility of Gaussian processes, the recently proposed INTEL algorithm provides a product of experts approach to online prediction of time series under possible regime switching, including the special case of outliers. This is achieved by adaptively combining several candidate models, each reporting their predictive distribution at time t. However, the INTEL algorithm uses a finite context window approximation to the predictive distribution, the computation of which scales cubically with the maximum lag, or otherwise scales quartically with exact predictive distributions. We introduce LINTEL, which uses the exact filtering distribution at time t with constant-time updates, making the time complexity of the streaming algorithm optimal. We additionally note that the weighting mechanism of INTEL is better suited to a mixture of experts approach, and propose a fusion policy based on arithmetic averaging for LINTEL. We show experimentally that our proposed approach is over five times faster than INTEL under reasonable settings with better quality predictions.
UR - https://www.scopus.com/pages/publications/85207691946
U2 - 10.23919/FUSION59988.2024.10706404
DO - 10.23919/FUSION59988.2024.10706404
M3 - Conference contribution
T3 - FUSION 2024 - 27th International Conference on Information Fusion
BT - FUSION 2024 - 27th International Conference on Information Fusion
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 27th International Conference on Information Fusion, FUSION 2024
Y2 - 7 July 2024 through 11 July 2024
ER -