On Identifiability of Nonnegative Matrix Factorization

09/02/2017
by   Xiao Fu, et al.
0

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 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/18/2018

Latitude: A Model for Mixed Linear-Tropical Matrix Factorization

Nonnegative matrix factorization (NMF) is one of the most frequently-use...
research
07/01/2021

Nonnegative Matrix Factorization with Group and Basis Restrictions

Nonnegative matrix factorization (NMF) is a popular method used to reduc...
research
10/23/2018

Model Selection for Nonnegative Matrix Factorization by Support Union Recovery

Nonnegative matrix factorization (NMF) has been widely used in machine l...
research
10/30/2017

Stochastic variance reduced multiplicative update for nonnegative matrix factorization

Nonnegative matrix factorization (NMF), a dimensionality reduction and f...
research
04/25/2018

Estimation with Low-Rank Time-Frequency Synthesis Models

Many state-of-the-art signal decomposition techniques rely on a low-rank...
research
06/14/2021

Crowdsourcing via Annotator Co-occurrence Imputation and Provable Symmetric Nonnegative Matrix Factorization

Unsupervised learning of the Dawid-Skene (D S) model from noisy, incom...
research
05/29/2023

Statistically Optimal K-means Clustering via Nonnegative Low-rank Semidefinite Programming

K-means clustering is a widely used machine learning method for identify...

Please sign up or login with your details

Forgot password? Click here to reset