Description Usage Arguments Value Author(s) References Examples
Fits a linear model to estimate one multi-way array from another, under the restriction that the coefficient array has given PARAFAC rank. By default, estimates are chosen to minimize a least-squares objective; an optional penalty term allows for $L_2$ regularization of the coefficient array.
1 |
X |
A predictor array of dimension N x P_1 x ... x P_L. |
Y |
An outcome array of dimension N x Q_1 x ... X Q_M. |
R |
Assumed rank of the P_1 x ... x P_L x Q_1 x ... x Q_M coefficient array. |
lambda |
Ridge ($L_2$) penalty parameter for the coefficient array. |
annealIter |
Number of tempering iterations to improve initialization |
convThresh |
Converge threshold for the absolute difference in the objective function between two iterations |
seed |
Random seed for generation of initial values. |
U |
List of length L. U[[l]]: P_l x R gives the coefficient basis for the l'th mode of X. |
V |
List of length M. V[[m]]: Q_m x R gives the coefficient basis for the m'th mode of Y. |
B |
Coefficient array of dimension P_1 x ... x P_L x Q_1 x ... x Q_M. Given by the CP factorization defined by U and V. |
sse |
Vector giving the sum of squared residuals at each iteration. |
sseR |
Vector giving the value of the objective (sse+penalty) at each iteration. |
Eric F. Lock
Lock, E. F. (2018). Tensor-on-tensor regression. Journal of Computational and Graphical Statistics, 27 (3): 638-647, 2018.
1 2 3 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.