Table of Contents
Fetching ...

Regression for matrix-valued data via Kronecker products factorization

Yin-Jen Chen, Minh Tang

TL;DR

This work tackles matrix-valued regression in high dimensions, where responses $Y_i$ and predictors $X_i$ are matrix-structured and dimensions exceed the sample size. It introduces KRO-PRO-FAC, a Kronecker-product factorization-based estimator that leverages vec rearrangements to avoid estimating full error covariance, reducing computational burden. The method yields perturbation bounds in spectral norm under sub-Gaussian errors and demonstrates competitive estimation and predictive performance in simulations and real data. An extension to multiple regressor blocks is developed, broadening applicability to multi-domain matrix regression with Kronecker-structured mean and covariance.

Abstract

We study the matrix-variate regression problem $Y_i = \sum_{k} β_{1k} X_i β_{2k}^{\top} + E_i$ for $i=1,2\dots,n$ in the high dimensional regime wherein the response $Y_i$ are matrices whose dimensions $p_{1}\times p_{2}$ outgrow both the sample size $n$ and the dimensions $q_{1}\times q_{2}$ of the predictor variables $X_i$ i.e., $q_{1},q_{2} \ll n \ll p_{1},p_{2}$. We propose an estimation algorithm, termed KRO-PRO-FAC, for estimating the parameters $\{β_{1k}\} \subset \Re^{p_1 \times q_1}$ and $\{β_{2k}\} \subset \Re^{p_2 \times q_2}$ that utilizes the Kronecker product factorization and rearrangement operations from Van Loan and Pitsianis (1993). The KRO-PRO-FAC algorithm is computationally efficient as it does not require estimating the covariance between the entries of the $\{Y_i\}$. We establish perturbation bounds between $\hatβ_{1k} -β_{1k}$ and $\hatβ_{2k} - β_{2k}$ in spectral norm for the setting where either the rows of $E_i$ or the columns of $E_i$ are independent sub-Gaussian random vectors. Numerical studies on simulated and real data indicate that our procedure is competitive, in terms of both estimation error and predictive accuracy, compared to other existing methods.

Regression for matrix-valued data via Kronecker products factorization

TL;DR

This work tackles matrix-valued regression in high dimensions, where responses and predictors are matrix-structured and dimensions exceed the sample size. It introduces KRO-PRO-FAC, a Kronecker-product factorization-based estimator that leverages vec rearrangements to avoid estimating full error covariance, reducing computational burden. The method yields perturbation bounds in spectral norm under sub-Gaussian errors and demonstrates competitive estimation and predictive performance in simulations and real data. An extension to multiple regressor blocks is developed, broadening applicability to multi-domain matrix regression with Kronecker-structured mean and covariance.

Abstract

We study the matrix-variate regression problem for in the high dimensional regime wherein the response are matrices whose dimensions outgrow both the sample size and the dimensions of the predictor variables i.e., . We propose an estimation algorithm, termed KRO-PRO-FAC, for estimating the parameters and that utilizes the Kronecker product factorization and rearrangement operations from Van Loan and Pitsianis (1993). The KRO-PRO-FAC algorithm is computationally efficient as it does not require estimating the covariance between the entries of the . We establish perturbation bounds between and in spectral norm for the setting where either the rows of or the columns of are independent sub-Gaussian random vectors. Numerical studies on simulated and real data indicate that our procedure is competitive, in terms of both estimation error and predictive accuracy, compared to other existing methods.
Paper Structure (4 sections, 8 equations, 3 algorithms)

This paper contains 4 sections, 8 equations, 3 algorithms.