CP Degeneracy in Tensor Regression

Abstract

Tensor linear regression is an important and useful tool for analyzing tensor data. To deal with high dimensionality, CANDECOMP/PARAFAC (CP) low-rank constraints are often imposed on the coefficient tensor parameter in the (penalized) $M$-estimation. However, we show that the corresponding optimization may not be attainable, and when this happens, the estimator is not well-defined. This is closely related to a phenomenon, called CP degeneracy, in low-rank tensor approximation problems. In this article, we provide useful results of CP degeneracy in tensor regression problems. In addition, we provide a general penalized strategy as a solution to overcome CP degeneracy. The asymptotic properties of the resulting estimation are also studied. Numerical experiments are conducted to illustrate our findings.

References in corpus (9)

• Tensor Regression with Applications in Neuroimaging Data Analysis
• Multilinear tensor regression for longitudinal relational data
• Tensor-on-tensor regression
• STORE: Sparse Tensor Response Regression and Neuroimaging Analysis
• Estimation with Norm Regularization
• Learning from Multiway Data: Simple and Efficient Tensor Regression
• Doubly Decomposing Nonparametric Tensor Regression
• Broadcasted Nonparametric Tensor Regression
• Sparse Tensor Additive Regression

Cited by in corpus (2)

• Reduced-Rank Tensor-on-Tensor Regression and Tensor-variate Analysis of Variance
• Broadcasted Nonparametric Tensor Regression