๐ฎ
๐ฎ
The Ethereal
Nonnegative Matrix Factorization Requires Irrationality
May 22, 2016 ยท The Ethereal ยท ๐ SIAM Journal on applied algebra and geometry
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Dmitry Chistikov, Stefan Kiefer, Ines Maruลกiฤ, Mahsa Shirmohammadi, James Worrell
arXiv ID
1605.06848
Category
cs.CC: Computational Complexity
Cross-listed
cs.LG,
math.NA
Citations
13
Venue
SIAM Journal on applied algebra and geometry
Last Checked
2 months ago
Abstract
Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative $n \times m$ matrix $M$ into a product of a nonnegative $n \times d$ matrix $W$ and a nonnegative $d \times m$ matrix $H$. A longstanding open question, posed by Cohen and Rothblum in 1993, is whether a rational matrix $M$ always has an NMF of minimal inner dimension $d$ whose factors $W$ and $H$ are also rational. We answer this question negatively, by exhibiting a matrix for which $W$ and $H$ require irrational entries.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Computational Complexity
๐ฎ
๐ฎ
The Ethereal
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
๐ฎ
๐ฎ
The Ethereal
The Parallelism Tradeoff: Limitations of Log-Precision Transformers
๐ฎ
๐ฎ
The Ethereal
The Hardness of Approximation of Euclidean k-means
๐ฎ
๐ฎ
The Ethereal
Slightly Superexponential Parameterized Problems
๐ฎ
๐ฎ
The Ethereal