Matrix Autoregressive Time Series With Reduced‐Rank and Sparse Structural Constraints
ABSTRACT Matrix‐ and tensor‐valued time series models have emerged as effective tools to address the challenges posed by high‐dimensional time series data. These models utilize the multi‐classification structures inherent in data variables to decompose large interaction networks into smaller, more manageable sub‐networks. To further reduce dimensionality, recent research has explored regularized matrix‐valued time series models. This study builds upon this line of work by proposing the RR‐S‐MAR model—a matrix autoregressive (MAR) model that incorporates a reduced‐rank structure on one side and a sparse structure on the other. We address key challenges related to the estimation, inference, and selection of the proposed model. For regularized estimation, we develop an alternating least‐squares algorithm, while statistical inference is conducted using a bootstrapping method. To optimize the selection of rank and sparsity level, we introduce an extended Bayesian information criterion (EBIC). Simulation studies demonstrate the convergence of the estimation algorithm and validate the effectiveness of the proposed model selection criterion. Finally, we apply the RR‐S‐MAR model to economic data, showcasing its practical utility and providing insights through real‐world analysis and interpretation.
Authors
- Philip L. H. Yu (ORCID: https://orcid.org/0000-0002-9449-0420)
- Xiaohang Wang (ORCID: https://orcid.org/0000-0002-2263-5643)
- Xin Ling (ORCID: https://orcid.org/0000-0001-6132-2781)
Institutions
- Beijing Normal-Hong Kong Baptist University (CN)
- Hong Kong Baptist University (HK)
- Education University of Hong Kong (HK)
Publication Details
- Journal
- Journal of Forecasting
- Published
- 2025-08-25
- DOI
- https://doi.org/10.1002/for.70019
- Primary Topic
- Statistical and numerical algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00