Computing Large-Scale Matrix and Tensor Decomposition With Structured Factors: A Unified Nonconvex Optimization Perspective
Computing Large-Scale Matrix and Tensor Decomposition With Structured Factors: A Unified Nonconvex Optimization Perspective
复制标题
DOI:
10.1109/msp.2020.3003544
复制
发表时间:
2020-06
影响因子:
14.9
通讯作者:
Xiao Fu;Nico Vervliet;L. De Lathauwer;Kejun Huang;Nicolas Gillis
中科院分区:
文献类型:
--
作者:
Xiao Fu;Nico Vervliet;L. De Lathauwer;Kejun Huang;Nicolas Gillis
During the past 20 years, low-rank tensor and matrix decomposition models (LRDMs) have become indispensable tools for signal processing, machine learning, and data science. LRDMs represent high-dimensional, multiaspect, and multimodal data using low-dimensional latent factors in a succinct and parsimonious way. LRDMs can serve a variety of purposes, e.g., data embedding (dimensionality reduction), denoising, latent variable analysis, model parameter estimation, and big data compression; see [1]-[5] for surveys of applications.