.png){kind=icon}
.png){kind=icon}
Return
Tensor Linear Regression: Degeneracy and Solution
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3049494.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Tensor regression is an important and useful tool for analyzing multidimensional array data. To deal with high dimensionality, CANDECOMP/PARAFAC (CP) low-rank constraints are often imposed on the coefficient tensor parameter in the (penalized) loss functions. However, besides the well-known non-identifiability issue of the CP parameters, we demonstrate that the corresponding optimization may not have any attainable solutions, and thus the estimation of the coefficient tensor is not well-defined when this happens. This is closely related to a phenomenon, called CP degeneracy, in low-rank tensor approximation problems. In this article, we show some useful results of CP degeneracy in the context of tensor regression problems. To overcome the theoretical and numerical issues associated with the degeneracy, we provide a general penalized strategy as a solution to the degeneracy. The related results also explain why some of the existing methods are more stable than the others. The asymptotic properties of the resulting estimation are also studied. Numerical experiments are conducted to illustrate our findings.
Keywords:
Tensors
Linear regression
Estimation
Optimization
Tools
Matrix decomposition
Licenses
High-dimensional regression
low-rank modeling
penalized regression
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W