pith. sign in

arxiv: 1709.00614 · v1 · pith:7Y2ZKT2Jnew · submitted 2017-09-02 · 💻 cs.LG · stat.ML

On Identifiability of Nonnegative Matrix Factorization

classification 💻 cs.LG stat.ML
keywords factorslatentnonnegativecriterionfactorfactorizationmatrixmodel
0
0 comments X
read the original abstract

In this letter, we propose a new identification criterion that guarantees the recovery of the low-rank latent factors in the nonnegative matrix factorization (NMF) model, under mild conditions. Specifically, using the proposed criterion, it suffices to identify the latent factors if the rows of one factor are \emph{sufficiently scattered} over the nonnegative orthant, while no structural assumption is imposed on the other factor except being full-rank. This is by far the mildest condition under which the latent factors are provably identifiable from the NMF model.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.