Fetching the paper…
Reading the bibliography…
Non-negative Matrix Factorization (NMF) asks to decompose a (entry-wise) non-negative matrix into the product of two smaller-sized nonnegative matrices, which has been shown intractable in general.
Learning the parts of objects by non-negative matrix factorization
Daniel D Lee and H Sebastian Seung · 1999
Earlier work this paper cites.
Algorithms for non-negative matrix factorization
Daniel D Lee and H Sebastian Seung · 2001
Earlier work this paper cites.
When does non-negative matrix factorization give a correct decomposition into parts?
David Donoho and Victoria Stodden · 2004
Earlier work this paper cites.
Fast monte-carlo algorithms for finding low-rank approximations
Alan Frieze, Ravi Kannan, and Santosh Vempala · 2004
Earlier work this paper cites.
Projected gradient methods for nonnegative matrix factorization
Chih-Jen Lin · 2007
Earlier work this paper cites.
Toward faster nonnegative matrix factorization: A new algorithm and comparisons
Jingu Kim and Haesun Park · 2008
Earlier work this paper cites.
Sparse subspace clustering
Ehsan Elhamifar and René Vidal · 2009
Earlier work this paper cites.
Cur matrix decompositions for improved data analysis
Michael W Mahoney and Petros Drineas · 2009
Earlier work this paper cites.
On the complexity of nonnegative matrix factorization
Stephen A Vavasis · 2009
Earlier work this paper cites.
Convex and semi-nonnegative matrix factorizations
Chris HQ Ding, Tao Li, and Michael I Jordan · 2010
Cited alongside, same era.
Fast coordinate descent methods with variable selection for non-negative matrix factorization
Cho-Jui Hsieh and Inderjit S Dhillon · 2011
Cited alongside, same era.
Computing a nonnegative matrix factorization–provably
Sanjeev Arora, Rong Ge, Ravindran Kannan, and Ankur Moitra · 2012
Cited alongside, same era.
Learning topic models–going beyond svd
Sanjeev Arora, Rong Ge, and Ankur Moitra · 2012
Cited alongside, same era.
A convex model for nonnegative matrix factorization and dimensionality reduction on physical space
Ernie Esser, Michael Moller, Stanley Osher, Guillermo Sapiro, and Jack Xin · 2012
Cited alongside, same era.
See all by looking at a few: Sparse modeling for finding representative objects
Ehsan Elhamifar, Guillermo Sapiro, and Rene Vidal · 2012
Divide-and-conquer anchoring for near-separable nonnegative matrix factorization and completion in high dimensions
Tianyi Zhou, Wei Bian, and Dacheng Tao · 2013
Later among the works it cites.
Fast and robust recursive algorithmsfor separable nonnegative matrix factorization
Nicolas Gillis and Stephen A Vavasis · 2014
Later among the works it cites.
Divide-and-conquer learning by anchoring a conical hull
Tianyi Zhou, Jeff A Bilmes, and Carlos Guestrin · 2014
Later among the works it cites.
Probabilistic latent semantic indexing
Thomas Hofmann · 2017
Later among the works it cites.
Quantum-inspired sublinear classical algorithms for solving low-rank linear systems
Nai-Hui Chia, Han-Hsuan Lin, and Chunhao Wang · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Mahnmf: Manhattan non-negative matrix factorization
Naiyang Guan, Dacheng Tao, Zhigang Luo, and John Shawe-Taylor · 2012
Cited alongside, same era.
Factoring nonnegative matrices with linear programs
Ben Recht, Christopher Re, Joel Tropp, and Victor Bittorf · 2012
Cited alongside, same era.
Fast conical hull algorithms for near-separable non-negative matrix factorization
Abhishek Kumar, Vikas Sindhwani, and Prabhanjan Kambadur · 2013
Cited alongside, same era.
Yuxuan Du, Tongliang Liu, Yinan Li, Runyao Duan, and Dacheng Tao · 2018
Later among the works it cites.
Quantum-inspired low-rank stochastic regression with logarithmic dependence on the dimension
András Gilyén, Seth Lloyd, and Ewin Tang · 2018
Later among the works it cites.
A quantum-inspired classical algorithm for recommendation systems
Ewin Tang · 2018
Later among the works it cites.