title: Correlated Noise: How it Breaks NMF, and What to Do About It.
abstract: Non-negative matrix factorization (NMF) is a problem of decomposing multivariate data into a set of features and their corresponding activations. When applied to experimental data, NMF has to cope with noise, which is often highly correlated. We show that correlated noise can break the Donoho and Stodden separability conditions of a dataset and a regular NMF algorithm will fail to decompose it, even when given freedom to be able to represent the noise as a separate feature. To cope with this issue, we present an algorithm for NMF with a generalized least squares objective function (glsNMF) and derive multiplicative updates for the method together with proving their convergence. The new algorithm successfully recovers the true representation from the noisy data. Robust performance can make glsNMF a valuable tool for analyzing empirical data.
authors.affiliation: Computer Science Department, University of New Mexico, New Mexico, USA, 87131.
authors.forename: Sergey M
authors.initials: SM
authors.lastname: Plis
authors.forename: Vamsi K
authors.initials: VK
authors.lastname: Potluru
authors.forename: Terran
authors.initials: T
authors.lastname: Lane
authors.forename: Vince D
authors.initials: VD
authors.lastname: Calhoun