Robustness Analysis of Hottopixx, a Linear Programming Model for Factoring Nonnegative Matrices
Abstract
Although nonnegative matrix factorization (NMF) is NP-hard in general, it has been shown very recently that it is tractable under the assumption that the input nonnegative data matrix is close to being separable (separability requires that all columns of the input matrix belongs to the cone spanned by a small subset of these columns). Since then, several algorithms have been designed to handle this subclass of NMF problems. In particular, Bittorf, Recht, R\'e and Tropp (`Factoring nonnegative matrices with linear programs', NIPS 2012) proposed a linear programming model, referred to as Hottopixx. In this paper, we provide a new and more general robustness analysis of their method. In particular, we design a provably more robust variant using a post-processing strategy which allows us to deal with duplicates and near duplicates in the dataset.
Keywords
Cite
@article{arxiv.1211.6687,
title = {Robustness Analysis of Hottopixx, a Linear Programming Model for Factoring Nonnegative Matrices},
author = {Nicolas Gillis},
journal= {arXiv preprint arXiv:1211.6687},
year = {2013}
}
Comments
23 pages; new numerical results; Comparison with Arora et al.; Accepted in SIAM J. Mat. Anal. Appl