On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization

Nicolas Gillis, Subhayan Saha, Stefano Sicilia +1

Given a nonnegative matrix $X$, a factorization rank $r$ and {a positive integer $p$}, entrywise power matrix factorization (EPMF) looks for a low-rank matrix $X_r$ such that $X =…