466 citations · 881 across the 30 of their papers we have counts for
4 papers · 1 filter
CANDECOMP/PARAFAC Decomposition of High-order Tensors Through Tensor Reshaping
Anh Huy Phan, Petr Tichavsky, Andrzej Cichocki
In general, algorithms for order-3 CANDECOMP/-PARAFAC (CP), also coined canonical polyadic decomposition (CPD), are easily to implement and can be extended to higher order CPD. Unf…
Cramer-Rao-Induced Bounds for CANDECOMP/PARAFAC tensor decomposition
Petr Tichavsky, Anh Huy Phan, Zbynek Koldovsky
This paper presents a Cramer-Rao lower bound (CRLB) on the variance of unbiased estimates of factor matrices in Canonical Polyadic (CP) or CANDECOMP/PARAFAC (CP) decompositions of…
Low Complexity Damped Gauss-Newton Algorithms for CANDECOMP/PARAFAC
Anh Huy Phan, Petr Tichavský, Andrzej Cichocki
The damped Gauss-Newton (dGN) algorithm for CANDECOMP/PARAFAC (CP) decomposition can handle the challenges of collinearity of factors and different magnitudes of factors; neverthel…
On Fast Computation of Gradients for CANDECOMP/PARAFAC Algorithms
Anh Huy Phan, Petr Tichavský, Andrzej Cichocki
Product between mode- unfolding $\bY_{(n)}$ of an -D tensor $\tY$ and Khatri-Rao products of factor matrices $\bA^{(m)}$, exists in algo…