Several Approximation Algorithms for Sparse Best Rank-1 Approximation to Higher-Order Tensors

no code implementations • 5 Dec 2020 • Xianpeng Mao, Yuning Yang

Sparse tensor best rank-1 approximation (BR1Approx), which is a sparsity generalization of the dense tensor BR1Approx, and is a higher-order extension of the sparse matrix BR1Approx, is one of the most important problems in sparse tensor decomposition and related problems arising from statistics and machine learning.

Tensor Decomposition