A universality theorem for nonnegative matrix factorizations

TL;DR

This paper proves that the space of nonnegative matrix factorizations is universal for all bounded semialgebraic sets and provides polynomial-time algorithms for constructing such factorizations when the set is defined by polynomial equations.

Contribution

It establishes a universality theorem for nonnegative matrix factorizations and offers polynomial-time methods for constructing factorizations for sets defined by polynomial equations.

Findings

Spaces of nonnegative factorizations are universal for bounded semialgebraic sets.

Polynomial-time algorithms exist for constructing factorizations of sets defined by polynomial equations.

The results clarify the algorithmic complexity of nonnegative rank and factorization over subfields.

Abstract

Let $A$ be a matrix with nonnegative real entries. A nonnegative factorization of size $k$ is a representation of $A$ as a sum of $k$ nonnegative rank-one matrices. The space of all such factorizations is a bounded semialgebraic set, and we prove that spaces arising in this way are universal. More presicely, we show that every bounded semialgebraic set $U$ is rationally equivalent to the set of nonnegative size-$k$ factorizations of some matrix $A$ up to a permutation of matrices in the factorization. We prove that, if $U\subset\mathbb{R}^n$ is given as the zero locus of a polynomial with coefficients in $\mathbb{Q}$, then such a pair $(A,k)$ can be computed in polynomial time. This result gives a complete description of the algorithmic complexity of nonnegative rank, and it also allows one to solve the problem of Cohen and Rothblum on nonnegative factorizations restricted to matrices over different subfields of $\mathbb{R}$.