Joint Tensor Factorization and Outlying Slab Suppression With Applications

• Published in: IEEE transactions on signal processing Vol. 63; no. 23; pp. 6315 - 6328
• Main Authors: Xiao Fu, Kejun Huang, Wing-Kin Ma, Sidiropoulos, Nicholas D., Bro, Rasmus
• Format: Journal Article
• Language: English
• Published: IEEE 01.12.2015
• Subjects: Algorithm design and analysis; Canonical polyadic decomposition; group sparsity; iteratively reweighted; Optimization; outliers; PARAFAC; Robustness; Signal processing algorithms; Slabs; Speech; Tensile stress; tensor decomposition
• ISSN: 1053-587X; 1941-0476
• DOI: 10.1109/TSP.2015.2469642

We consider factoring low-rank tensors in the presence of outlying slabs. This problem is important in practice, because data collected in many real-world applications, such as speech, fluorescence, and some social network data, fit this paradigm. Prior work tackles this problem by iteratively selecting a fixed number of slabs and fitting, a procedure which may not converge. We formulate this problem from a group-sparsity promoting point of view, and propose an alternating optimization framework to handle the corresponding ℓ p (0 <; p ≤ 1) minimization-based low-rank tensor factorization problem. The proposed algorithm features a similar per-iteration complexity as the plain trilinear alternating least squares (TALS) algorithm. Convergence of the proposed algorithm is also easy to analyze under the framework of alternating optimization and its variants. In addition, regularization and constraints can be easily incorporated to make use of a priori information on the latent loading factors. Simulations and real data experiments on blind speech separation, fluorescence data analysis, and social network mining are used to showcase the effectiveness of the proposed algorithm.