Regularized Estimation of High-Dimensional Matrix-Variate Autoregressive Models
Hangjin Jiang, Baining Shen, Yuzhou Li, Zhaoxing Gao

TL;DR
This paper introduces regularized estimation techniques for high-dimensional matrix-variate autoregressive models, improving interpretability and forecasting accuracy by leveraging banded and sparse structures.
Contribution
It proposes two novel regularization methods—banded and sparse—for matrix-variate autoregressive models, with theoretical properties and practical validation.
Findings
Banded and sparse estimators outperform traditional methods in simulations.
The methods effectively identify relevant interactions in real data.
Asymptotic properties are established for high-dimensional settings.
Abstract
Matrix-variate time series data are increasingly popular in economics, statistics, and environmental studies, among other fields. This paper develops regularized estimation methods for analyzing high-dimensional matrix-variate time series using bilinear matrix-variate autoregressive models. The bilinear autoregressive structure is widely used for matrix-variate time series, as it reduces model complexity while capturing interactions between rows and columns. However, when dealing with large dimensions, the commonly used iterated least-squares method results in numerous estimated parameters, making interpretation difficult. To address this, we propose two regularized estimation methods to further reduce model dimensionality. The first assumes banded autoregressive coefficient matrices, where each data point interacts only with nearby points. A two-step estimation method is used: first,…
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
TopicsNeural Networks and Applications
