CANDECOMP/PARAFAC decomposition of high-order tensors through tensor reshaping

AH Phan, P Tichavský… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
In general, algorithms for order-3 CANDECOMP/PARAFAC (CP), also coined canonical
polyadic decomposition (CPD), are easy to implement and can be extended to higher order …

Error preserving correction: A method for CP decomposition at a target error bound

AH Phan, P Tichavský… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
In CANDECOMP/PARAFAC tensor decomposition, degeneracy often occurs in some difficult
scenarios, especially, when the rank exceeds the tensor dimension, or when the loading …

A critique of tensor probabilistic independent component analysis: implications and recommendations for multi-subject fMRI data analysis

NE Helwig, S Hong - Journal of neuroscience methods, 2013 - Elsevier
Tensor Probabilistic Independent Component Analysis (TPICA) is a popular tool for
analyzing multi-subject fMRI data (voxels× time× subjects) because of TPICA's supposed …

Cramér-Rao-induced bounds for CANDECOMP/PARAFAC tensor decomposition

P Tichavsky, AH Phan… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
This paper presents a Cramér-Rao lower bound (CRLB) on the variance of unbiased
estimates of factor matrices in Canonical Polyadic (CP) or CANDECOMP/PARAFAC (CP) …

On generic nonexistence of the Schmidt--Eckart--Young decomposition for complex tensors

N Vannieuwenhoven, J Nicaise, R Vandebril… - SIAM Journal on Matrix …, 2014 - SIAM
The Schmidt--Eckart--Young theorem for matrices states that the optimal rank-r
approximation of a matrix is obtained by retaining the first r terms from the singular value …

Finding the limit of diverging components in three-way Candecomp/Parafac—A demonstration of its practical merits

A Stegeman - Computational Statistics & Data Analysis, 2014 - Elsevier
Abstract Three-way Candecomp/Parafac (CP) is a three-way generalization of principal
component analysis (PCA) for matrices. Contrary to PCA, a CP decomposition is rotationally …

Non-orthogonal tensor diagonalization

P Tichavský, AH Phan, A Cichocki - Signal Processing, 2017 - Elsevier
Tensor diagonalization means transforming a given tensor to an exactly or nearly diagonal
form through multiplying the tensor by non-orthogonal invertible matrices along selected …

Systems of polynomial equations, higher-order tensor decompositions, and multidimensional harmonic retrieval: A unifying framework. Part II: The block term …

J Vanderstukken, P Kürschner, I Domanov… - SIAM Journal on Matrix …, 2021 - SIAM
In Part I we proposed a multilinear algebra framework to solve 0-dimensional systems of
polynomial equations with simple roots. We extend this framework to incorporate multiple …

A three-way Jordan canonical form as limit of low-rank tensor approximations

A Stegeman - SIAM Journal on Matrix Analysis and Applications, 2013 - SIAM
A best rank-R approximation of an order-3 tensor or three-way array may not exist due to the
fact that the set of three-way arrays with rank at most R is not closed. In this case, we are …

Three-mode factor analysis by means of Candecomp/Parafac

A Stegeman, TTT Lam - Psychometrika, 2014 - Springer
A three-mode covariance matrix contains covariances of N observations (eg, subject scores)
on J variables for K different occasions or conditions. We model such an JK× JK covariance …