Minimizing low-rank models of high-order tensors: Hardness, span, tight relaxation, and applications

no code implementations • 16 Oct 2022 • Nicholas D. Sidiropoulos, Paris Karakasis, Aritra Konar

We show that this fundamental tensor problem is NP-hard for any tensor rank higher than one, and polynomial-time solvable in the rank-one case.

Graph Mining Recommendation Systems +1