On Restricted Nonnegative Matrix Factorization

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$. Restricted NMF requires in addition that the column spaces of $M$ and $W$ coincide. Finding the minimal inner dimension $d$ is known to be NP-hard, both for NMF and restricted NMF. We show that restricted NMF is closely related to a question about the nature of minimal probabilistic automata, posed by Paz in his seminal 1971 textbook. We use this connection to answer Paz's question negatively, thus falsifying a positive answer claimed in 1974. Furthermore, we investigate whether a rational matrix $M$ always has a restricted NMF of minimal inner dimension whose factors $W$ and $H$ are also rational. We show that this holds for matrices $M$ of rank at most $3$ and we exhibit a rank-$4$ matrix for which $W$ and $H$ require irrational entries.

[1]  H. Sebastian Seung,et al.  Learning the parts of objects by non-negative matrix factorization , 1999, Nature.

[2]  Mariëlle Stoelinga,et al.  An Introduction to Probabilistic Automata , 2002, Bull. EATCS.

[3]  Serhat Selcuk Bucak,et al.  Video Content Representation by Incremental Non-Negative Matrix Factorization , 2007, 2007 IEEE International Conference on Image Processing.

[4]  Stephen A. Vavasis,et al.  On the Complexity of Nonnegative Matrix Factorization , 2007, SIAM J. Optim..

[5]  Michael W. Berry,et al.  Discovering gene functional relationships using FAUN (Feature Annotation Using Nonnegative matrix factorization) , 2010, BMC Bioinformatics.

[6]  Nicolas Gillis,et al.  On the Geometric Interpretation of the Nonnegative Rank , 2010, 1009.0880.

[7]  Vikas Sindhwani,et al.  Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization , 2012, ICML.

[8]  Andrzej Cichocki,et al.  Nonnegative Matrix and Tensor Factorization T , 2007 .

[9]  Stefan Kiefer,et al.  Trace Refinement in Labelled Markov Decision Processes , 2016, FoSSaCS.

[10]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[11]  Yukihiko Yamashita,et al.  Smooth nonnegative matrix and tensor factorizations for robust multi-way data analysis , 2015, Signal Process..

[12]  Nicolas Gillis,et al.  Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization , 2013, SIAM J. Optim..

[13]  Joel E. Cohen,et al.  Nonnegative ranks, decompositions, and factorizations of nonnegative matrices , 1993 .

[14]  Victoria Stodden,et al.  When Does Non-Negative Matrix Factorization Give a Correct Decomposition into Parts? , 2003, NIPS.

[15]  Alok Aggarwal,et al.  Finding Minimal Convex Nested Polygons , 1989, Inf. Comput..

[16]  François Bancilhon.  A Geometric Model for Stochastic Automata , 1974, IEEE Transactions on Computers.

[17]  Nicolas Gillis,et al.  Document classification using nonnegative matrix factorization and underapproximation , 2009, 2009 IEEE International Symposium on Circuits and Systems.

[18]  Nino Antulov-Fantulin,et al.  Learning from Incomplete Ratings using Nonlinear Multi-layer Semi-Nonnegative Matrix Factorization , 2017, ArXiv.

[19]  Sanjeev Arora,et al.  Computing a nonnegative matrix factorization -- provably , 2011, STOC '12.