Joint Tensor Factorization and Outlying Slab Suppression With Applications
From MaRDI portal
(Redirected from Publication:4580939)
Abstract: 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 () 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 emph{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.
Cited in
(4)- Convenient tail bounds for sums of random tensors
- General tail bounds for random tensors summation: majorization approach
- Rethinking coupled tensor analysis for hyperspectral superresolution: recoverable modeling under endmember variability
- Tensor decision trees for continual learning from drifting data streams
This page was built for publication: Joint Tensor Factorization and Outlying Slab Suppression With Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580939)
