Nearest Neighbor Multivariate Time Series Forecasting
Huiliang Zhang, Ping Nie, Lijun Sun, Benoit Boulet

TL;DR
This paper introduces a k-nearest neighbor framework for multivariate time series forecasting that leverages large datasets without additional training, improving accuracy and interpretability over existing methods.
Contribution
The paper proposes a novel kNN-MTS framework with a hybrid encoder, enabling scalable, training-free, and more accurate multivariate time series forecasting.
Findings
Significant performance improvements on real-world datasets.
Enhanced interpretability and efficiency of forecasting.
Ability to utilize entire dataset for pattern retrieval.
Abstract
Multivariate time series (MTS) forecasting has a wide range of applications in both industry and academia. Recently, spatial-temporal graph neural networks (STGNNs) have gained popularity as MTS forecasting methods. However, current STGNNs can only use the finite length of MTS input data due to the computational complexity. Moreover, they lack the ability to identify similar patterns throughout the entire dataset and struggle with data that exhibit sparsely and discontinuously distributed correlations among variables over an extensive historical period, resulting in only marginal improvements. In this article, we introduce a simple yet effective k-nearest neighbor MTS forecasting ( kNN-MTS) framework, which forecasts with a nearest neighbor retrieval mechanism over a large datastore of cached series, using representations from the MTS model for similarity search. This approach requires…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsMatching The Statements
