Fast Conical Hull Algorithms for Near-Separable Non-Negative Matrix Factorization
Abstract
The separability assumption (Arora et al., 2012; Donoho & Stodden, 2003) turns non-negative matrix factorization (NMF) into a tractable problem. Recently, a new class of provably-correct NMF algorithms have emerged under this assumption. In this paper, we reformulate the separable NMF problem as that of finding the extreme rays of the conical hull of a finite set of vectors. From this geometric perspective, we derive new separable NMF algorithms that are highly scalable and empirically noise robust, and have several favorable properties in relation to existing methods. A parallel implementation of our algorithm scales excellently on shared and distributed-memory machines.
Cite
Text
Kumar et al. "Fast Conical Hull Algorithms for Near-Separable Non-Negative Matrix Factorization." International Conference on Machine Learning, 2013.Markdown
[Kumar et al. "Fast Conical Hull Algorithms for Near-Separable Non-Negative Matrix Factorization." International Conference on Machine Learning, 2013.](https://mlanthology.org/icml/2013/kumar2013icml-fast/)BibTeX
@inproceedings{kumar2013icml-fast,
title = {{Fast Conical Hull Algorithms for Near-Separable Non-Negative Matrix Factorization}},
author = {Kumar, Abhishek and Sindhwani, Vikas and Kambadur, Prabhanjan},
booktitle = {International Conference on Machine Learning},
year = {2013},
pages = {231-239},
volume = {28},
url = {https://mlanthology.org/icml/2013/kumar2013icml-fast/}
}