Pith. sign in

REVIEW 3 major objections 6 minor 95 references

Accurate and Efficient Multivariate Time Series Forecasting via Offline Clustering

T0 review · 3 major / 6 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A fixed set of offline-clustered segment prototypes can replace all-pairs attention in multivariate forecasting, giving linear-time inference and top-1 accuracy in 26 of 28 settings.

desk verdict Read it for the method, not the theorem: the prototype-attention idea is new and the complexity story is clean, but the approximation proof doesn't hold and the SOTA claim rests on an unfair benchmark. read the letter →

arxiv 2505.05738 v2 pith:SVXMVMRL submitted 2025-05-09 cs.LG cs.AI

Yiming Niu , Jinliang Deng , Lulu Zhang , Zimu Zhou , Yongxin Tong This is my paper · ORCID
classification cs.LGcs.AI
keywords multivariatetimeseriesforecastinglong-rangedependenciesofflineclusteringprototypeslinear-complexityattentionlow-rankapproximationdual-brancharchitectureefficientinference
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

FOCUS claims that the long-range dependencies a multivariate forecaster needs can be captured by a small fixed set of segment prototypes discovered once offline, so online modeling only has to relate incoming segments to these prototypes rather than to each other. If true, this replaces the quadratic cost of self-attention with linear cost while preserving, and in the paper's experiments improving, accuracy. The core evidence is ProtoAttn, which computes attention weights per prototype and maps the results back to segments with an assignment matrix, together with a low-rank approximation theorem showing that the gap from full self-attention stays small when the segment matrix has rank no larger than the prototype count. The paper reports top-1 results on 26 of 28 benchmark settings and lower FLOPs and peak memory than the compared models.

What carries the argument

The load-bearing object is the prototype set $C = \{c_j\} \subset \mathbb{R}^p$, one representative segment pattern per cluster, obtained offline by minimizing the weighted loss $L = L_{\text{rec}} + \alpha L_{\text{corr}}$ that combines Euclidean reconstruction error with negative Pearson correlation to each assigned segment. Online, the assignment matrix $A \in \mathbb{R}^{l\times k}$ links each input segment to its nearest prototype, and ProtoAttn computes the attention map between embedded prototypes and input segments as $A\,\mathrm{softmax}(C_Q K^\top/\sqrt{d})\,V$, so all segments in the same bucket share the same attention weights. Runtime is linear in $l$ because $k$ is constant, and Theorem 1, built on the Johnson–Lindenstrauss lemma, is the argument that this prototype-based computation is close to full self-attention when the input segment matrix is low rank. The dual-branch extractor and parallel fusion module push the same mechanism along time and entity dimensions.

What would settle it

Run FOCUS on a test set deliberately composed of segment shapes absent from training, such as synthetic ramps with steepness beyond any prototype or event patterns created by concatenating unseen motifs, and record whether MSE rises sharply as the fraction of unseen segments increases; if error degrades much faster than for a full self-attention model, the fixed-prototype low-rank assumption is the point of failure.

Watch

Extended reading notes

Core claim

The central claim is that a fixed set of $k$ offline-clustered segment prototypes can act as the query side of attention: each incoming segment is assigned to its nearest prototype to form an assignment matrix $A$, and the attention output is $A\,\mathrm{softmax}(C_Q K^\top/\sqrt{d_k})\,V$, where $C_Q$ are embedded prototypes and $K,V$ come from the input segments. Because $k$ is fixed and independent of input length, complexity becomes $O(kl)$ in the number of segments $l$. Theorem 1 argues that if the segment matrix $P$ has rank at most $r$, the prototype-based low-rank approximation $AC$ approximates $P$ under projection by any column of $W_Q W_K^\top$ up to relative error $\epsilon$ with high probability, using $k = O(\log r / \epsilon^2)$ prototypes. The same mechanism runs separately along temporal and entity dimensions in a dual-branch extractor, and a parallel fusion module with $m$ fixed readout queries combines the two feature sets before projecting to the forecast. The paper claims this design is both more accurate and cheaper than all-pairs attention, and in the experiments FOCUS ranks first in 26 of 28 settings.

Load-bearing premise

The load-bearing premise is that a small fixed set of offline-discovered segment patterns can faithfully represent every segment that appears online; the test data's patterns do not drift away from the training patterns, and the number of distinct recurring patterns does not grow with sequence length.

Editorial extensions

If this is right

  • Forecasting on very long histories becomes practical: doubling the lookback doubles rather than quadruples compute, so the model can exploit the accuracy gains of longer context windows that the paper observes on PEMS08.
  • The expensive pattern-discovery cost is paid once per dataset offline and then amortized across all online instances and entities, making per-forecast inference cheap.
  • The learned dependency map between prototypes is interpretable: the paper's case study shows the model finding long-range couplings such as morning traffic rises depending on the previous night's decline.
  • On resource-constrained devices, the lower FLOPs and peak memory give an accuracy-per-compute advantage over self-attention models, which the paper positions as the practical motivation for the design.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A useful diagnostic the paper does not report would be to track each test segment's distance to its nearest prototype; if forecasting error climbs as that distance grows, practitioners would have a direct signal for when the offline prototype set needs refreshing.
  • The benefit of a fixed prototype set is regime-dependent: when the lookback is short enough that the prototype count $k$ is comparable to the segment count $l$, the constant overhead of $k$ prototypes can dominate and the linear-time advantage largely disappears.
  • The assignment matrix doubles as an event label for every moment in history, so the same mechanism could power downstream anomaly detection or explanation tools without additional supervision.
  • A natural extension would be a slowly updated prototype set learned online; the paper only studies fixed offline prototypes, but its own non-stationarity experiment suggests a moderate refresh could extend the method's validity without losing the linear-complexity guarantee.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The paper introduces FOCUS, a two-phase multivariate time series forecasting method. In an offline phase, it segments the training series and clusters the segments into k prototypes using Euclidean distance plus Pearson correlation. In the online phase, input segments are assigned to the nearest prototypes, and a module called ProtoAttn computes attention between embedded prototypes and input segments, aiming to model long-range dependencies in linear time. A dual-branch architecture extracts temporal and entity features and fuses them through a readout/gating mechanism. The paper claims state-of-the-art accuracy (top-1 among 8 compared models on 26 of 28 settings) with reduced FLOPs and memory, and it reports ablations, parameter studies, outlier-robustness experiments, and case studies on seven benchmark datasets.

Significance. If the empirical claims hold, FOCUS would provide a practical linear-complexity alternative to quadratic self-attention for long-horizon multivariate forecasting, with the additional appeal of interpretable offline-discovered prototypes. The paper includes public code, reports experiments on seven standard datasets, and provides extensive ablations and sensitivity analyses, which are strengths. However, the theoretical justification in Sec. VI-B is not valid as written, and the headline accuracy claim rests on a benchmark that omits several standard recent baselines and tunes FOCUS's hyperparameters while using untuned baseline configurations. The central methodological idea is defensible, but the strongest claims are not yet fully supported.

major comments (3)
  1. [Sec. VI-B, Theorem 1 and Eqs. (20)-(31)] The theorem does not prove what the paper claims. The section is titled 'Approximation Analysis of ProtoAttn', but the statement and proof only concern a low-rank approximation \tilde P = AC of the input matrix P; the actual ProtoAttn output in Eq. (18), namely A softmax(C_Q K^T / sqrt(d_k)) V, involves a softmax nonlinearity and value projections, and none of these objects appear in the proof. The dimensions are also inconsistent: P is in R^{l x p}, w is drawn from a column of W_Q W_K^T in R^{d x d}, so P w^T is undefined unless p = d, and \tilde P = AC with C in R^{k x d} has dimension l x d, not l x p. Equation (24) is not a valid Johnson-Lindenstrauss statement as written: for R in R^{k x d}, x in R^k, y in R^k, the products x R^T R y^T and x y^T have incompatible shapes, and the bound k = 5 log r / (epsilon^2 - epsilon^3) is not derived. Because the abstract and Sec. VI-B use this theorem to justify that linear-complexity proto-attention approximates self-attention, this is a load-bearing theoretical gap. The authors should either provide a correct, properly dimensioned argument that bounds the attention output, or remove the theorem and support the approximation claim empirically.
  2. [Sec. VIII-A, Table III] The headline claims of 'state-of-the-art accuracy' and 'top-1 among the 8 models on 26 out of 28 settings' are not yet supported by a fair comparison. The baseline set omits iTransformer [55], TSMixer [29], TiDE [20], and ModernTCN [58], all of which are cited in Sec. IX and are standard strong models in long-term multivariate forecasting; a 26/28 win rate over the included subset does not establish state-of-the-art performance. In addition, Sec. VIII-A states that 'we use the original configurations for all baseline models', while for FOCUS the segment length p and prototype count k were obtained by grid search, so FOCUS receives per-dataset validation-based tuning that the baselines do not. To support the accuracy claim, the authors should add the missing baselines or explicitly restrict the claim to the compared subset, and should show that the win rate is robust under a fairer protocol, such as fixed p and k for FOCUS or validation-based tuning for all models.
  3. [Sec. VIII-D] The paper's own generalization study admits that test-set segments can be unseen relative to the offline prototypes, yet the evidence is only qualitative: Fig. 9 shows a single test instance, and no quantitative measure of prototype coverage or approximation error on test data is reported. Since the method's accuracy relative to full self-attention depends on the premise that a small fixed set of offline prototypes remains representative of online inputs, the authors should report a quantitative evaluation of the prototype approximation error as a function of k and of distribution shift, perhaps by measuring the reconstruction error of test segments assigned to prototypes or the attention-output discrepancy against full attention.
minor comments (6)
  1. [Sec. VI-A, Eq. (14) and Algorithm 2] Algorithm 2 line 6 sets V <- P W^Q, but Eq. (14) defines V = P W^V; this is likely a typo and should be corrected.
  2. [Table III] The TimesNet entries for PEMS08 (0.66 at horizon 96 and 0.07 at horizon 336) appear to be missing a decimal point or otherwise misprinted; please check and correct these values.
  3. [Sec. VIII-C, Table IV] The text states that the ablation study was conducted on the PEMS04 dataset, but Table IV reports results for PEMS08 and Electricity; the text and table should be reconciled.
  4. [Sec. V, Eq. (6) and Algorithm 1] The assignment step uses a discrete argmin while the prototype update uses gradient descent; please state explicitly that this is an alternating Lloyd-style procedure and clarify whether Eq. (11) is intended as a bi-level optimization objective.
  5. [Sec. II, Definition 2 and Table I] The notation in Definition 2 uses D both for the dataset and for the number of entities, which conflicts with Table I where N denotes the number of entities; please use a distinct symbol for the entity count.
  6. [Throughout] There are several typos and awkward phrasings, including 'expanding this across all query centroids yields will get us' in Sec. VI-A, 'foreacasting' in Sec. VII, and 'even as the perturbation ratio improves' in Sec. VIII-E; a careful proofread is needed.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: FOCUS's empirical claims rest on external benchmarks and its efficiency claims are direct operation counts; the Theorem 1 gap is a proof-soundness issue, not a circular reduction.

full rationale

The paper's central predictive claims are empirical: FOCUS is compared against eight external baselines on standard multivariate forecasting datasets, with the model trained on training splits and evaluated on held-out test splits. This is ordinary supervised learning, not a fitted parameter renamed as a prediction. The linear-complexity claim is a direct count of operations with a fixed number of prototypes k, so it does not reduce to an input assumption. The theoretical part, Theorem 1, is not a circular derivation: it invokes the Johnson-Lindenstrauss lemma from Linformer [74] to state a low-rank approximation bound for the segment matrix. The proof does not actually bound the softmax attention output of ProtoAttn, and the existential matrices A and C constructed in the proof are not shown to equal the assignment and prototype matrices used in Algorithm 2. This is a correctness/soundness gap, not a case where the conclusion is identical to the input by construction. The experimental asymmetries noted in the benchmark section (grid-searching p and k for FOCUS while keeping baseline configurations, and omitting some common strong baselines) are fairness concerns about the comparative claim, not circularity under the definitions used here. No load-bearing self-citation chain appears: prior works by the present authors are cited contextually and are not used to justify the method's correctness. Therefore no significant circularity is found.

Assumptions & free parameters 5 free parameters · 4 assumptions · 0 invented entities

The model depends on a handful of user-chosen hyperparameters (k, p, alpha, d, m) and on the assumption that time series have a bounded number of recurring segment patterns. The theoretical guarantee in Theorem 1 further assumes low-rank input and relies on a borrowed JL lemma that is misapplied. No new physical entities are introduced.

free parameters (5)
  • k (number of prototypes) = not reported (grid-searched per dataset)
    Controls the effective rank of the attention approximation and the online cost; selected by grid search per dataset (Sec. VIII-A).
  • p (segment length) = not reported (grid-searched per dataset)
    Length of each time segment used for clustering and patching; selected by grid search (Sec. VIII-A).
  • alpha (correlation loss weight) = 0.2
    Fixed weight balancing Euclidean and correlation similarity in Eq. (6) and Eq. (10); chosen by hand, no sensitivity analysis except in Fig. 8 comparing with and without the correlation term.
  • d (embedding size) = 128 (PEMS04/PEMS08), 64 (others)
    Dimension of query/key/value embeddings; set per dataset in Sec. VIII-A.
  • m (readout token count) = 6 (horizon 96), 21 (horizon 336)
    Number of fixed queries in the Parallel Fusion Module; set per horizon in Sec. VIII-A.
assumptions (4)
  • domain assumption The input time series matrix P has low rank, rank(P) <= r, where r is the number of representative segment patterns found offline.
    Invoked in Theorem 1 (Sec. VI-B) to justify that a small prototype set can approximate the input. The paper does not verify this rank bound on real datasets; Sec. VIII-B1 only shows a plateau in accuracy as k grows.
  • domain assumption Segment patterns are stationary enough that offline prototypes remain representative for online and test inputs.
    The whole offline clustering strategy presumes that patterns in the training set recur in the test set. The paper acknowledges non-stationarity in Sec. VIII-D and tests it qualitatively on one Electricity instance only.
  • standard math Johnson-Lindenstrauss lemma applies to the product C^T C as used in Proof 1.
    The proof relies on the JL lemma from [74], but the lemma statement (Eq. 24) has dimension mismatches; the applicability to C^T C w (a projection back to R^d) is not justified.
  • domain assumption Segments are independent units for clustering; the one-hot assignment in Eq. (6) ignores temporal order and entity identity beyond the correlation term.
    Eq. (6) assigns each segment to the nearest prototype independently, which the correlation loss only partially addresses; this independence is assumed for the linear-complexity computation.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Accurate and Efficient Multivariate Time Series Forecasting via Offline Clustering." pith.science (2026). https://pith.science/paper/SVXMVMRL

@misc{pith2026250505738,
  author       = {Pith},
  title        = {Pith review of: Accurate and Efficient Multivariate Time Series Forecasting via Offline Clustering},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SVXMVMRL}},
  note         = {Machine review of arXiv:2505.05738}
}
read the original abstract

Accurate and efficient multivariate time series (MTS) forecasting is essential for applications such as traffic management and weather prediction, which depend on capturing long-range temporal dependencies and interactions between entities. Existing methods, particularly those based on Transformer architectures, compute pairwise dependencies across all time steps, leading to a computational complexity that scales quadratically with the length of the input. To overcome these challenges, we introduce the Forecaster with Offline Clustering Using Segments (FOCUS), a novel approach to MTS forecasting that simplifies long-range dependency modeling through the use of prototypes extracted via offline clustering. These prototypes encapsulate high-level events in the real-world system underlying the data, summarizing the key characteristics of similar time segments. In the online phase, FOCUS dynamically adapts these patterns to the current input and captures dependencies between the input segment and high-level events, enabling both accurate and efficient forecasting. By identifying prototypes during the offline clustering phase, FOCUS reduces the computational complexity of modeling long-range dependencies in the online phase to linear scaling. Extensive experiments across diverse benchmarks demonstrate that FOCUS achieves state-of-the-art accuracy while significantly reducing computational costs.

Figures

Figures reproduced from arXiv: 2505.05738 by the authors.

Figure 1
Figure 1. Modeling long-range dependency on Traffic [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Overview of the proposed FOCUS. index t is consistent across all variables, meaning that the time step corresponding to xe1,t is the same as the time step corresponding to xe2,t for t = 1, 2, . . . , T. Relationships or dependencies may exist between the variables. Definition 3: (Multivariate Time Series Forecasting) The goal of multivariate time series forecasting is to predict future segments of the series based o… view at source ↗
Figure 3
Figure 3. Example from Traffic dataset [76] of a 7-day period. [PITH_FULL_IMAGE:figures/full_fig_p003_3.png] view at source ↗
Figures from the paper (7 more)
Figure 4
Figure 4. Figure 4: Online bucket assignment and the computation for [PITH_FULL_IMAGE:figures/full_fig_p005_4.png]
Figure 5
Figure 5. Figure 5: The information flow of Parallel Fusion Module. [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 6
Figure 6. Figure 6: Comparison of FLOPs, Peak Memory Occupation, Number of Parameters with baselines. [PITH_FULL_IMAGE:figures/full_fig_p009_6.png]
Figure 7
Figure 7. Figure 7: Impact of (a) number of prototypes k, (b) embedding size d, (c) length of the input sequence L and (d) patch length p in FOCUS for long-term forecasting on PEMS08 dataset. on the PEMS08 dataset. Increasing k enlarges the prototype correlation matrix we need to calculat…
Figure 9
Figure 9. Figure 9: A test instance in the Electricity dataset and the [PITH_FULL_IMAGE:figures/full_fig_p011_9.png]
Figure 12
Figure 12. Figure 12: Visualization of the input series for case study and [PITH_FULL_IMAGE:figures/full_fig_p011_12.png]
Figure 13
Figure 13. Figure 13: An example of long-range dependency extracted by [PITH_FULL_IMAGE:figures/full_fig_p012_13.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

95 extracted references · 60 canonical work pages

  1. [55]

    itransformer: Inverted transformers are effective for time series forecasting

    Yong Liu, Tengge Hu, Haoran Zhang, Haixu Wu, Shiyu Wang, Lintao Ma, and Mingsheng Long. itransformer: Inverted transformers are effective for time series forecasting. InInternational Conference on Learning Representations, 2023

    work page 2023

  2. [29]

    Tsmixer: Lightweight mlp-mixer model for multivariate time series forecasting

    Vijay Ekambaram, Arindam Jati, Nam Nguyen, Phanwadee Sinthong, and Jayant Kalagnanam. Tsmixer: Lightweight mlp-mixer model for multivariate time series forecasting. InProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, page 459–469, 2023

    work page 2023

  3. [20]

    Long-term forecasting with tide: Time-series dense encoder.Transactions on Machine Learning Research

    Abhimanyu Das, Weihao Kong, Andrew Leach, Shaan K Mathur, Rajat Sen, and Rose Yu. Long-term forecasting with tide: Time-series dense encoder.Transactions on Machine Learning Research

    work page

  4. [58]

    Moderntcn: A modern pure convolution structure for general time series analysis

    Donghao Luo and Xue Wang. Moderntcn: A modern pure convolution structure for general time series analysis. InInternational Conference on Learning Representations, 2024

    work page 2024

  5. [1]

    Energy time series forecasting based on pattern sequence similarity.IEEE Transactions on Knowledge and Data Engineering, 23(8):1230–1243, 2010

    Francisco Martinez Alvarez, Alicia Troncoso, Jose C Riquelme, and Jesus S Aguilar Ruiz. Energy time series forecasting based on pattern sequence similarity.IEEE Transactions on Knowledge and Data Engineering, 23(8):1230–1243, 2010

    2010

  6. [2]

    Anderson, George E

    Oliver D. Anderson, George E. P. Box, and Gwilym M. Jenkins. Time series analysis: Forecasting and control.The Statistician, page 265, Sep 1978

    1978

  7. [3]

    Stock price prediction using the arima model

    Adebiyi A Ariyo, Adewumi O Adewumi, and Charles K Ayo. Stock price prediction using the arima model. In2014 UKSim-AMSS 16th international conference on computer modelling and simulation, pages 106–112. IEEE, 2014

    2014

  8. [4]

    Adaptive graph convolutional recurrent network for traffic forecasting.Advances in Neural Information Processing Systems, 33:17804–17815, 2020

    Lei Bai, Lina Yao, Can Li, Xianzhi Wang, and Can Wang. Adaptive graph convolutional recurrent network for traffic forecasting.Advances in Neural Information Processing Systems, 33:17804–17815, 2020

    2020

Show all 95 references
  1. [5]

    Forecasting across time series databases using recurrent neural networks on groups of similar series: A clustering approach.Expert systems with applications, 140:112896, 2020

    Kasun Bandara, Christoph Bergmeir, and Slawek Smyl. Forecasting across time series databases using recurrent neural networks on groups of similar series: A clustering approach.Expert systems with applications, 140:112896, 2020

    2020

  2. [6]

    Learning long-term dependencies with gradient descent is difficult.IEEE transactions on neural networks, 5(2):157–166, 1994

    Yoshua Bengio, Patrice Simard, and Paolo Frasconi. Learning long-term dependencies with gradient descent is difficult.IEEE transactions on neural networks, 5(2):157–166, 1994

    1994

  3. [7]

    Recurrent neural networks for multivariate time series with missing values.Scientific reports, 8(1):6085, 2018

    Zhengping Che, Sanjay Purushotham, Kyunghyun Cho, David Sontag, and Yan Liu. Recurrent neural networks for multivariate time series with missing values.Scientific reports, 8(1):6085, 2018

    2018

  4. [8]

    From similarity to superiority: Channel clustering for time series forecasting.Advances in Neural Information Processing Systems, 37:130635–130663, 2025

    Jialin Chen, Jan Eric Lenssen, Aosong Feng, Weihua Hu, Matthias Fey, Leandros Tassiulas, Jure Leskovec, and Rex Ying. From similarity to superiority: Channel clustering for time series forecasting.Advances in Neural Information Processing Systems, 37:130635–130663, 2025

    2025

  5. [9]

    Minprompt: Graph-based minimal prompt data augmentation for few-shot question answering

    Xiusi Chen, Jyun-Yu Jiang, Wei-Cheng Chang, Cho-Jui Hsieh, Hsiang- Fu Yu, and Wei Wang. Minprompt: Graph-based minimal prompt data augmentation for few-shot question answering. InProceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1:...

    2024

  6. [10]

    Reliable: Offline reinforcement learning for tactical strategies in professional basketball games

    Xiusi Chen, Jyun-Yu Jiang, Kun Jin, Yichao Zhou, Mingyan Liu, P Jeffrey Brantingham, and Wei Wang. Reliable: Offline reinforcement learning for tactical strategies in professional basketball games. In Proceedings of the 31st ACM International Conference on Information and Know...

    2022

  7. [11]

    Playbest: Professional basketball player behavior synthesis via planning with diffusion

    Xiusi Chen, Wei-Yao Wang, Ziniu Hu, David Reynoso, Kun Jin, Mingyan Liu, P Jeffrey Brantingham, and Wei Wang. Playbest: Professional basketball player behavior synthesis via planning with diffusion. InProceedings of the 33rd ACM International Conference on Information and Know...

    2024

  8. [12]

    Gotta: generative few-shot question answering by prompt-based cloze data augmentation

    Xiusi Chen, Yu Zhang, Jinliang Deng, Jyun-Yu Jiang, and Wei Wang. Gotta: generative few-shot question answering by prompt-based cloze data augmentation. InProceedings of the 2023 SIAM International Conference on Data Mining (SDM), pages 909–917. SIAM, 2023

    2023

  9. [13]

    A novel deep class-imbalanced semisupervised model for wind turbine blade icing detection.IEEE Transactions on Neural Networks and Learning Systems, 33(6):2558–2570, 2021

    Xu Cheng, Fan Shi, Xiufeng Liu, Meng Zhao, and Shengyong Chen. A novel deep class-imbalanced semisupervised model for wind turbine blade icing detection.IEEE Transactions on Neural Networks and Learning Systems, 33(6):2558–2570, 2021

    2021

  10. [14]

    Weakly guided adaptation for robust time series forecasting.Proceedings of the VLDB Endowment, 17(4):766–779, 2023

    Yunyao Cheng, Peng Chen, Chenjuan Guo, Kai Zhao, Qingsong Wen, Bin Yang, and Christian S Jensen. Weakly guided adaptation for robust time series forecasting.Proceedings of the VLDB Endowment, 17(4):766–779, 2023

    2023

  11. [15]

    Empirical evaluation of gated recurrent neural networks on sequence modeling.arXiv preprint arXiv:1412.3555, 2014

    Junyoung Chung, Caglar Gulcehre, KyungHyun Cho, and Yoshua Ben- gio. Empirical evaluation of gated recurrent neural networks on sequence modeling.arXiv preprint arXiv:1412.3555, 2014

    2014 arXiv

  12. [16]

    Enhancenet: Plugin neural networks for enhancing correlated time series forecasting

    Razvan-Gabriel Cirstea, Tung Kieu, Chenjuan Guo, Bin Yang, and Sinno Jialin Pan. Enhancenet: Plugin neural networks for enhancing correlated time series forecasting. In2021 IEEE 37th International Conference on Data Engineering, pages 1739–1750. IEEE, 2021

    2021

  13. [17]

    Towards spatio-temporal aware traffic time series forecasting

    Razvan-Gabriel Cirstea, Bin Yang, Chenjuan Guo, Tung Kieu, and Shirui Pan. Towards spatio-temporal aware traffic time series forecasting. In 2022 IEEE 38th International Conference on Data Engineering, pages 2900–2913. IEEE, 2022

    2022

  14. [18]

    Recurrent neural networks and robust time series prediction.IEEE transactions on neural networks, 5(2):240–254, 1994

    Jerome T Connor, R Douglas Martin, and Les E Atlas. Recurrent neural networks and robust time series prediction.IEEE transactions on neural networks, 5(2):240–254, 1994

    1994

  15. [19]

    Metro: a generic graph neural network framework for multivariate time series forecasting.Proceedings of the VLDB Endowment, 15(2):224–236, 2021

    Yue Cui, Kai Zheng, Dingshan Cui, Jiandong Xie, Liwei Deng, Feiteng Huang, and Xiaofang Zhou. Metro: a generic graph neural network framework for multivariate time series forecasting.Proceedings of the VLDB Endowment, 15(2):224–236, 2021

    2021

  16. [21]

    St-norm: Spatial and temporal normalization for multi-variate time series forecasting

    Jinliang Deng, Xiusi Chen, Renhe Jiang, Xuan Song, and Ivor W Tsang. St-norm: Spatial and temporal normalization for multi-variate time series forecasting. InProceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 269–278, 2021

    2021

  17. [22]

    A multi-view multi-task learning framework for multi-variate time series forecasting.IEEE Transactions on Knowledge and Data Engineering, 35(8):7665–7680, 2022

    Jinliang Deng, Xiusi Chen, Renhe Jiang, Xuan Song, and Ivor W Tsang. A multi-view multi-task learning framework for multi-variate time series forecasting.IEEE Transactions on Knowledge and Data Engineering, 35(8):7665–7680, 2022

    2022

  18. [23]

    Disentangling structured components: Towards adaptive, interpretable and scalable time series forecasting.IEEE Transactions on Knowledge and Data Engineering, 2024

    Jinliang Deng, Xiusi Chen, Renhe Jiang, Du Yin, Yi Yang, Xuan Song, and Ivor W Tsang. Disentangling structured components: Towards adaptive, interpretable and scalable time series forecasting.IEEE Transactions on Knowledge and Data Engineering, 2024

    2024

  19. [24]

    Parsimony or capability? decomposition delivers both in long- term time series forecasting

    Jinliang Deng, Feiyang Ye, Du Yin, Xuan Song, Ivor Tsang, and Hui Xiong. Parsimony or capability? decomposition delivers both in long- term time series forecasting. InThe Thirty-eighth Annual Conference on Neural Information Processing Systems, 2024

    2024

  20. [25]

    Identifying important variables of energy use in low energy office building by using multivariate analysis

    Natasa Djuric and V ojislav Novakovic. Identifying important variables of energy use in low energy office building by using multivariate analysis. Energy and Buildings, 45:91–98, 2012

    2012

  21. [26]

    Heterogeneity-informed meta- parameter learning for spatiotemporal time series forecasting

    Zheng Dong, Renhe Jiang, Haotian Gao, Hangchen Liu, Jinliang Deng, Qingsong Wen, and Xuan Song. Heterogeneity-informed meta- parameter learning for spatiotemporal time series forecasting. InPro- ceedings of the 30th ACM SIGKDD conference on knowledge discovery and data mining,...

    2024

  22. [27]

    An image is worth 16x16 words: Transformers for image recognition at scale

    Alexey Dosovitskiy, Lucas Beyer, Alexander Kolesnikov, Dirk Weis- senborn, Xiaohua Zhai, Thomas Unterthiner, Mostafa Dehghani, Matthias Minderer, Georg Heigold, Sylvain Gelly, et al. An image is worth 16x16 words: Transformers for image recognition at scale. In International C...

    2020

  23. [28]

    Adarnn: Adaptive learning and forecasting of time series

    Yuntao Du, Jindong Wang, Wenjie Feng, Sinno Pan, Tao Qin, Renjun Xu, and Chongjun Wang. Adarnn: Adaptive learning and forecasting of time series. InProceedings of the 30th ACM International Conference on Information and Knowledge Management, pages 402–411, 2021

    2021

  24. [30]

    Finding structure in time.Cognitive science, 14(2):179–211, 1990

    Jeffrey L Elman. Finding structure in time.Cognitive science, 14(2):179–211, 1990

    1990

  25. [31]

    Rep- resentation degeneration problem in training natural language generation models.arXiv preprint arXiv:1907.12009, 2019

    Jun Gao, Di He, Xu Tan, Tao Qin, Liwei Wang, and Tie-Yan Liu. Rep- resentation degeneration problem in training natural language generation models.arXiv preprint arXiv:1907.12009, 2019

    1907 arXiv

  26. [32]

    Multivariate short-term traffic flow forecasting using time-series analysis.IEEE transactions on intelligent transportation systems, 10(2):246–254, 2009

    Bidisha Ghosh, Biswajit Basu, and Margaret O’Mahony. Multivariate short-term traffic flow forecasting using time-series analysis.IEEE transactions on intelligent transportation systems, 10(2):246–254, 2009

    2009

  27. [33]

    Towards total traffic awareness.ACM SIGMOD Record, 43(3):18–23, 2014

    Chenjuan Guo, Christian S Jensen, and Bin Yang. Towards total traffic awareness.ACM SIGMOD Record, 43(3):18–23, 2014

    2014

  28. [34]

    Self-supervised spatial- temporal bottleneck attentive network for efficient long-term traffic forecasting

    Shengnan Guo, Youfang Lin, Letian Gong, Chenyu Wang, Zeyu Zhou, Zekai Shen, Yiheng Huang, and Huaiyu Wan. Self-supervised spatial- temporal bottleneck attentive network for efficient long-term traffic forecasting. In2023 IEEE 39th International Conference on Data Engineering, ...

    2023

  29. [35]

    Cash, Timothy DelSole, and Arindam Banerjee

    Sijie He, Xinyan Li, Laurie Trenary, Benjamin A. Cash, Timothy DelSole, and Arindam Banerjee. Learning and dynamical models for sub-seasonal climate forecasting: Comparison and collaboration. In Proceedings of the AAAI conference on artificial intelligence, pages 4495–4503, 2022

    2022

  30. [36]

    Oneshotstl: One-shot seasonal-trend decomposition for online time series anomaly detection and forecasting.Proceedings of the VLDB Endowment, 16(6):1399– 1412, 2023

    Xiao He, Ye Li, Jian Tan, Bin Wu, and Feifei Li. Oneshotstl: One-shot seasonal-trend decomposition for online time series anomaly detection and forecasting.Proceedings of the VLDB Endowment, 16(6):1399– 1412, 2023

    2023

  31. [37]

    Long short-term memory

    Sepp Hochreiter and J ¨urgen Schmidhuber. Long short-term memory. Neural computation, 9(8):1735–1780, 1997

    1997

  32. [38]

    Lora: Low-rank adaptation of large language models.arXiv preprint arXiv:2106.09685, 2021

    Edward J Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen. Lora: Low-rank adaptation of large language models.arXiv preprint arXiv:2106.09685, 2021

    2021 arXiv

  33. [39]

    Stochastic origin-destination matrix forecasting using dual-stage graph convolutional, recurrent neural networks

    Jilin Hu, Bin Yang, Chenjuan Guo, Christian S Jensen, and Hui Xiong. Stochastic origin-destination matrix forecasting using dual-stage graph convolutional, recurrent neural networks. In2020 IEEE 36th International Conference on Data Engineering, pages 1417–1428. IEEE, 2020

    2020

  34. [40]

    Batch normalization: Accelerating deep network training by reducing internal covariate shift

    Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by reducing internal covariate shift. InInterna- tional Conference on Machine Learning, pages 448–456. pmlr, 2015

    2015

  35. [41]

    Lentzakis, and Gao Cong

    Yue Jiang, Xiucheng Li, Yile Chen, Shuai Liu, Weilong Kong, Antonis F. Lentzakis, and Gao Cong. SAGDFN: A scalable adaptive graph diffusion forecasting network for multivariate time series forecasting. InInternational Conference on Data Engineering, pages 1255–1268. IEEE, 2024

    2024

  36. [42]

    Cambridge University Press, 2017

    Lutz Kilian and Helmut L ¨utkepohl.Structural vector autoregressive analysis. Cambridge University Press, 2017

    2017

  37. [43]

    Reversible instance normalization for accurate time- series forecasting against distribution shift

    Taesung Kim, Jinhee Kim, Yunwon Tae, Cheonbok Park, Jang-Ho Choi, and Jaegul Choo. Reversible instance normalization for accurate time- series forecasting against distribution shift. InInternational Conference on Learning Representations, 2021

    2021

  38. [44]

    Kingma and Jimmy Ba

    Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. InInternational Conference on Learning Representations, 2015

    2015

  39. [45]

    Reformer: The efficient transformer

    Nikita Kitaev, Lukasz Kaiser, and Anselm Levskaya. Reformer: The efficient transformer. InInternational Conference on Learning Repre- sentations, 2019

    2019

  40. [46]

    Mod- eling long-and short-term temporal patterns with deep neural networks

    Guokun Lai, Wei-Cheng Chang, Yiming Yang, and Hanxiao Liu. Mod- eling long-and short-term temporal patterns with deep neural networks. InThe 41st international ACM SIGIR conference on research & devel- opment in information retrieval, pages 95–104, 2018

    2018

  41. [47]

    Lightcts: A lightweight framework for correlated time series forecasting.Proceedings of the ACM on Management of Data, 1(2):1– 26, 2023

    Zhichen Lai, Dalin Zhang, Huan Li, Christian S Jensen, Hua Lu, and Yan Zhao. Lightcts: A lightweight framework for correlated time series forecasting.Proceedings of the ACM on Management of Data, 1(2):1– 26, 2023

    2023

  42. [48]

    Shape- former: Shapelet transformer for multivariate time series classification

    Xuan-May Le, Ling Luo, Uwe Aickelin, and Minh-Tuan Tran. Shape- former: Shapelet transformer for multivariate time series classification. InProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 1484–1494, 2024

    2024

  43. [49]

    Efficient shapelet discovery for time series classification.IEEE transactions on knowledge and data engineering, 34(3):1149–1163, 2020

    Guozhong Li, Byron Choi, Jianliang Xu, Sourav S Bhowmick, Kwok- Pan Chun, and Grace Lai-Hung Wong. Efficient shapelet discovery for time series classification.IEEE transactions on knowledge and data engineering, 34(3):1149–1163, 2020

    2020

  44. [50]

    Shapenet: A shapelet-neural network approach for multivariate time series classification

    Guozhong Li, Byron Choi, Jianliang Xu, Sourav S Bhowmick, Kwok- Pan Chun, and Grace Lai-Hung Wong. Shapenet: A shapelet-neural network approach for multivariate time series classification. InPro- ceedings of the AAAI conference on artificial intelligence, volume 35, pages 8375...

    2021

  45. [51]

    Lst- net: Learning a convolutional neural network with a learnable sparse transform

    Lida Li, Kun Wang, Shuai Li, Xiangchu Feng, and Lei Zhang. Lst- net: Learning a convolutional neural network with a learnable sparse transform. InEuropean Conference on Computer Vision, pages 562–

  46. [52]

    Towards long-term time-series forecasting: Feature, pattern, and distribution

    Yan Li, Xinjiang Lu, Haoyi Xiong, Jian Tang, Jiantao Su, Bo Jin, and Dejing Dou. Towards long-term time-series forecasting: Feature, pattern, and distribution. In2023 IEEE 39th International Conference on Data Engineering, pages 1611–1624. IEEE, 2023

    2023

  47. [53]

    Units: A universal time series analysis framework powered by self- supervised representation learning

    Zhiyu Liang, Chen Liang, Zheng Liang, Hongzhi Wang, and Bo Zheng. Units: A universal time series analysis framework powered by self- supervised representation learning. InCompanion of the 2024 Interna- tional Conference on Management of Data, SIGMOD/PODS ’24, page 480–483. Ass...

    2024

  48. [54]

    Pyraformer: Low-complexity pyramidal attention for long-range time series modeling and forecasting

    Shizhan Liu, Hang Yu, Cong Liao, Jianguo Li, Weiyao Lin, Alex X Liu, and Schahram Dustdar. Pyraformer: Low-complexity pyramidal attention for long-range time series modeling and forecasting. In International Conference on Learning Representations, 2021

    2021

  49. [56]

    Swin transformer: Hierarchical vision transformer using shifted windows

    Ze Liu, Yutong Lin, Yue Cao, Han Hu, Yixuan Wei, Zheng Zhang, Stephen Lin, and Baining Guo. Swin transformer: Hierarchical vision transformer using shifted windows. InProceedings of the IEEE/CVF international conference on computer vision, pages 10012–10022, 2021

    2021

  50. [57]

    Decoupled weight decay regularization.arXiv preprint arXiv:1711.05101, 2017

    I Loshchilov. Decoupled weight decay regularization.arXiv preprint arXiv:1711.05101, 2017

    2017 arXiv

  51. [59]

    Learning time-aware graph structures for spatially correlated time series forecasting

    Minbo Ma, Jilin Hu, Christian S Jensen, Fei Teng, Peng Han, Zhiqiang Xu, and Tianrui Li. Learning time-aware graph structures for spatially correlated time series forecasting. In2024 IEEE 40th International Conference on Data Engineering, pages 4435–4448. IEEE, 2024

    2024

  52. [60]

    Hmm-boost: Improved time series state prediction via su- pervised hidden markov models: Case studies in epileptic seizure and complex care management

    Georgios Mavroudeas, Malik Magdon-Ismail, Xiao Shou, and Kristin P Bennett. Hmm-boost: Improved time series state prediction via su- pervised hidden markov models: Case studies in epileptic seizure and complex care management. In2022 IEEE International Conference on Data Minin...

    2022

  53. [61]

    Identifying predictive multi-dimensional time series mo- tifs: an application to severe weather prediction.Data Mining and Knowledge Discovery, 22:232–258, 2011

    Amy McGovern, Derek H Rosendahl, Rodger A Brown, and Kelvin K Droegemeier. Identifying predictive multi-dimensional time series mo- tifs: an application to severe weather prediction.Data Mining and Knowledge Discovery, 22:232–258, 2011

    2011

  54. [62]

    A time series is worth 64 words: Long-term forecasting with transformers

    Yuqi Nie, Nam H Nguyen, Phanwadee Sinthong, and Jayant Kalagnanam. A time series is worth 64 words: Long-term forecasting with transformers. InInternational Conference on Learning Represen- tations, 2023

    2023

  55. [63]

    Tfb: Towards comprehensive and fair benchmarking of time series forecasting methods.Proceedings of the VLDB Endowment, 17(9):2363– 2377, 2024

    Xiangfei Qiu, Jilin Hu, Lekui Zhou, Xingjian Wu, Junyang Du, Buang Zhang, Chenjuan Guo, Aoying Zhou, Christian S Jensen, Zhenli Sheng, et al. Tfb: Towards comprehensive and fair benchmarking of time series forecasting methods.Proceedings of the VLDB Endowment, 17(9):2363– 2377, 2024

    2024

  56. [64]

    Language models are unsupervised multitask learners.OpenAI blog, 1(8):9, 2019

    Alec Radford, Jeffrey Wu, Rewon Child, David Luan, Dario Amodei, Ilya Sutskever, et al. Language models are unsupervised multitask learners.OpenAI blog, 1(8):9, 2019

    2019

  57. [65]

    Exploring progress in multivariate time series forecasting: Comprehensive bench- marking and heterogeneity analysis.IEEE Transactions on Knowledge and Data Engineering, 2024

    Zezhi Shao, Fei Wang, Yongjun Xu, Wei Wei, Chengqing Yu, Zhao Zhang, Di Yao, Tao Sun, Guangyin Jin, Xin Cao, et al. Exploring progress in multivariate time series forecasting: Comprehensive bench- marking and heterogeneity analysis.IEEE Transactions on Knowledge and Data Engin...

    2024

  58. [66]

    Decoupled dynamic spatial-temporal graph neural network for traffic forecasting.Proceedings of the VLDB Endowment, 15(11):2733–2746, 2022

    Zezhi Shao, Zhao Zhang, Wei Wei, Fei Wang, Yongjun Xu, Xin Cao, and Christian S Jensen. Decoupled dynamic spatial-temporal graph neural network for traffic forecasting.Proceedings of the VLDB Endowment, 15(11):2733–2746, 2022

    2022

  59. [67]

    Scaling law for time series forecasting.arXiv preprint arXiv:2405.15124, 2024

    Jingzhe Shi, Qinwei Ma, Huan Ma, and Lei Li. Scaling law for time series forecasting.arXiv preprint arXiv:2405.15124, 2024

    2024 arXiv

  60. [68]

    Time-series classification methods: Review and applications to power systems data

    Gian Antonio Susto, Angelo Cenedese, and Matteo Terzi. Time-series classification methods: Review and applications to power systems data. Big data application in power systems, pages 179–220, 2018

    2018

  61. [69]

    Wavenet: A generative model for raw audio.arXiv preprint arXiv:1609.03499, 12, 2016

    Aaron Van Den Oord, Sander Dieleman, Heiga Zen, Karen Simonyan, Oriol Vinyals, Alex Graves, Nal Kalchbrenner, Andrew Senior, Koray Kavukcuoglu, et al. Wavenet: A generative model for raw audio.arXiv preprint arXiv:1609.03499, 12, 2016

    2016 arXiv

  62. [70]

    Neural discrete representation learning.Advances in Neural Information Processing Systems, 30, 2017

    Aaron Van Den Oord, Oriol Vinyals, et al. Neural discrete representation learning.Advances in Neural Information Processing Systems, 30, 2017

    2017

  63. [71]

    Visualizing data using t-sne.Journal of machine learning research, 9(11), 2008

    Laurens Van der Maaten and Geoffrey Hinton. Visualizing data using t-sne.Journal of machine learning research, 9(11), 2008

    2008

  64. [72]

    Attention is all you need.Advances in Neural Information Processing Systems, 30, 2017

    Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. Attention is all you need.Advances in Neural Information Processing Systems, 30, 2017

    2017

  65. [73]

    Deep uncertainty quantification: A machine learning approach for weather forecasting

    Bin Wang, Jie Lu, Zheng Yan, Huaishao Luo, Tianrui Li, Yu Zheng, and Guangquan Zhang. Deep uncertainty quantification: A machine learning approach for weather forecasting. InProceedings of the 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 2087–2095, 2019

    2019

  66. [74]

    Linformer: Self-attention with linear complexity.arXiv preprint arXiv:2006.04768, 2020

    Sinong Wang, Belinda Z Li, Madian Khabsa, Han Fang, and Hao Ma. Linformer: Self-attention with linear complexity.arXiv preprint arXiv:2006.04768, 2020

    2006 arXiv

  67. [75]

    Timesnet: Temporal 2d-variation modeling for general time series analysis

    Haixu Wu, Tengge Hu, Yong Liu, Hang Zhou, Jianmin Wang, and Mingsheng Long. Timesnet: Temporal 2d-variation modeling for general time series analysis. InInternational Conference on Learning Repre- sentations, 2023

    2023

  68. [76]

    Autoformer: Decomposition transformers with auto-correlation for long-term series forecasting.Advances in Neural Information Processing Systems, 34:22419–22430, 2021

    Haixu Wu, Jiehui Xu, Jianmin Wang, and Mingsheng Long. Autoformer: Decomposition transformers with auto-correlation for long-term series forecasting.Advances in Neural Information Processing Systems, 34:22419–22430, 2021

    2021

  69. [77]

    Autocts: Automated correlated time series forecasting.Proceedings of the VLDB Endowment, 15(4):971–983, 2021

    Xinle Wu, Dalin Zhang, Chenjuan Guo, Chaoyang He, Bin Yang, and Christian S Jensen. Autocts: Automated correlated time series forecasting.Proceedings of the VLDB Endowment, 15(4):971–983, 2021

    2021

  70. [78]

    Autocts+: Joint neural architecture and hyperparam- eter search for correlated time series forecasting.Proceedings of the ACM on Management of Data, 1(1):1–26, 2023

    Xinle Wu, Dalin Zhang, Miao Zhang, Chenjuan Guo, Bin Yang, and Christian S Jensen. Autocts+: Joint neural architecture and hyperparam- eter search for correlated time series forecasting.Proceedings of the ACM on Management of Data, 1(1):1–26, 2023

    2023

  71. [79]

    Connecting the dots: Multivariate time series forecasting with graph neural networks

    Zonghan Wu, Shirui Pan, Guodong Long, Jing Jiang, Xiaojun Chang, and Chengqi Zhang. Connecting the dots: Multivariate time series forecasting with graph neural networks. InProceedings of the 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 753–763, 2020

    2020

  72. [80]

    Graph wavenet for deep spatial-temporal graph modeling

    Zonghan Wu, Shirui Pan, Guodong Long, Jing Jiang, and Chengqi Zhang. Graph wavenet for deep spatial-temporal graph modeling. In Proceedings of the 28th International Joint Conference on Artificial Intelligence, pages 1907–1913, 2019

    1907

  73. [81]

    Learning evolvable time-series shapelets

    Akihiro Yamaguchi, Ken Ueo, and Hisashi Kashima. Learning evolvable time-series shapelets. In2022 IEEE 38th International Conference on Data Engineering, pages 793–805. IEEE, 2022

    2022

  74. [82]

    Flashp: an analytical pipeline for real-time forecasting of time-series relational data.Proceedings of the VLDB Endowment, 14(5):721–729, 2021

    Shuyuan Yan, Bolin Ding, Wei Guo, Jingren Zhou, Zhewei Wei, Xiaowei Jiang, and Sheng Xu. Flashp: an analytical pipeline for real-time forecasting of time-series relational data.Proceedings of the VLDB Endowment, 14(5):721–729, 2021

    2021

  75. [83]

    Simplets: An efficient and universal model selection framework for time series forecasting

    Yuanyuan Yao, Dimeng Li, Hailiang Jie, Hailiang Jie, Tianyi Li, Jie Chen, Jiaqi Wang, Feifei Li, and Yunjun Gao. Simplets: An efficient and universal model selection framework for time series forecasting. Proceedings of the VLDB Endowment, 16(12):3741–3753, 2023

    2023

  76. [85]

    Learning the evolutionary and multi-scale graph structure for multivariate time series forecasting

    Junchen Ye, Zihan Liu, Bowen Du, Leilei Sun, Weimiao Li, Yanjie Fu, and Hui Xiong. Learning the evolutionary and multi-scale graph structure for multivariate time series forecasting. InProceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages ...

    2022

  77. [86]

    Time series shapelets: a new primitive for data mining

    Lexiang Ye and Eamonn Keogh. Time series shapelets: a new primitive for data mining. InProceedings of the 15th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 947–956, 2009

    2009

  78. [87]

    Are transformers effective for time series forecasting? InProceedings of the AAAI conference on artificial intelligence, volume 37, pages 11121–11128, 2023

    Ailing Zeng, Muxi Chen, Lei Zhang, and Qiang Xu. Are transformers effective for time series forecasting? InProceedings of the AAAI conference on artificial intelligence, volume 37, pages 11121–11128, 2023

    2023

  79. [88]

    Scaling up multivariate time series pre-training with decoupled spatial-temporal representations

    Rui Zha, Le Zhang, Shuangli Li, Jingbo Zhou, Tong Xu, Hui Xiong, and Enhong Chen. Scaling up multivariate time series pre-training with decoupled spatial-temporal representations. In2024 IEEE 40th International Conference on Data Engineering, pages 667–678. IEEE, 2024

    2024

  80. [89]

    Crossformer: Transformer utilizing cross-dimension dependency for multivariate time series forecasting

    Yunhao Zhang and Junchi Yan. Crossformer: Transformer utilizing cross-dimension dependency for multivariate time series forecasting. In International Conference on Learning Representations, 2023

    2023

  81. [91]

    Multiple time series forecasting with dynamic graph modeling.Proceedings of the VLDB Endowment, 17(4):753–765, 2023

    Kai Zhao, Chenjuan Guo, Yunyao Cheng, Peng Han, Miao Zhang, and Bin Yang. Multiple time series forecasting with dynamic graph modeling.Proceedings of the VLDB Endowment, 17(4):753–765, 2023

    2023

  82. [92]

    Informer: Beyond efficient transformer for long sequence time-series forecasting

    Haoyi Zhou, Shanghang Zhang, Jieqi Peng, Shuai Zhang, Jianxin Li, Hui Xiong, and Wancai Zhang. Informer: Beyond efficient transformer for long sequence time-series forecasting. InProceedings of the AAAI conference on artificial intelligence, volume 35, pages 11106–11115, 2021

    2021

  83. [93]

    Fedformer: Frequency enhanced decomposed transformer for long-term series forecasting

    Tian Zhou, Ziqing Ma, Qingsong Wen, Xue Wang, Liang Sun, and Rong Jin. Fedformer: Frequency enhanced decomposed transformer for long-term series forecasting. InInternational Conference on Machine Learning, pages 27268–27286. PMLR, 2022

    2022

  84. [94]

    One fits all: Power general time series analysis by pretrained lm.Advances in Neural Information Processing Systems, 36:43322–43355, 2023

    Tian Zhou, Peisong Niu, Liang Sun, Rong Jin, et al. One fits all: Power general time series analysis by pretrained lm.Advances in Neural Information Processing Systems, 36:43322–43355, 2023

    2023

  85. [95]

    Deformable detr: Deformable transformers for end-to-end object detection.arXiv preprint arXiv:2010.04159, 2020

    Xizhou Zhu, Weijie Su, Lewei Lu, Bin Li, Xiaogang Wang, and Jifeng Dai. Deformable detr: Deformable transformers for end-to-end object detection.arXiv preprint arXiv:2010.04159, 2020

    2010 arXiv

  86. [96]

    Darker: Efficient transformer with data- driven attention mechanism for time series.Proceedings of the VLDB Endowment, 17(11):3229–3242, 2024

    Rundong Zuo, Guozhong Li, Rui Cao, Byron Choi, Jianliang Xu, and Sourav S Bhowmick. Darker: Efficient transformer with data- driven attention mechanism for time series.Proceedings of the VLDB Endowment, 17(11):3229–3242, 2024

    2024

  87. [97]

    Svp-t: a shape-level variable- position transformer for multivariate time series classification

    Rundong Zuo, Guozhong Li, Byron Choi, Sourav S Bhowmick, Daphne Ngar-yin Mah, and Grace LH Wong. Svp-t: a shape-level variable- position transformer for multivariate time series classification. InPro- ceedings of the AAAI Conference on Artificial Intelligence, volume 37, pages...

    2023

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.