An Efficient and Interpretable Autoregressive Model for High-Dimensional Tensor-Valued Time Series
Yuxi Cai, Lan Li, Yize Wang, Guodong Li

TL;DR
This paper introduces a novel CP-based autoregressive model for high-dimensional tensor time series that balances interpretability and efficiency, incorporating low-rank and sparse structures for improved modeling.
Contribution
It proposes a new CP-based low-rank tensor autoregressive model with a sparse extension, providing both interpretability and efficiency in high-dimensional settings.
Findings
The model achieves superior prediction accuracy in simulations.
The approach offers clear interpretability of tensor factors.
Application to ENSO data demonstrates practical effectiveness.
Abstract
In autoregressive modeling for tensor-valued time series, Tucker decomposition, when applied to the coefficient tensor, provides a clear interpretation of supervised factor modeling but loses its efficiency rapidly with increasing tensor order. Conversely, canonical polyadic (CP) decomposition maintains efficiency but lacks a precise statistical interpretation. To attain both interpretability and powerful dimension reduction, this paper proposes a novel approach under the supervised factor modeling paradigm, which first uses CP decomposition to extract response and covariate features separately and then regresses response features on covariate ones. This leads to a new CP-based low-rank structure for the coefficient tensor. Furthermore, to address heterogeneous signals or potential model misspecifications arising from stringent low-rank assumptions, a low-rank plus sparse model is…
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
TopicsTensor decomposition and applications · Computational Physics and Python Applications
