No article text was recorded for this version.
computational complexity of NMF
Version 1 of 118 papers25 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Computing a nonnegative matrix factorization - provably
- Blog: Nonnegative Matrix Factorization Requires Irrationality
- Blog: On the geometric interpretation of the nonnegative rank
- Blog: Lifting for Simplicity: Concise Descriptions of Convex Sets
- Blog: Quantum Divide-and-Conquer Anchoring for Separable Non-negative Matrix Factorization
- Blog: Scalable Methods for Nonnegative Matrix Factorizations of Near-separable Tall-and-skinny Matrices
- Blog: Simultaneous clustering of multi-type relational data via symmetric nonnegative matrix tri-factorization
- Blog: Factoring nonnegative matrices with linear programs
- Blog: Heuristics for Exact Nonnegative Matrix Factorization
- Blog: Nonnegative Sparse PCA with Provable Guarantees
- Blog: Lower bounds on nonnegative rank via nonnegative nuclear norms
- Blog: Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
- Blog: Coseparable Nonnegative Tensor Factorization With T-CUR Decomposition
- Blog: A Quantum-inspired Classical Algorithm for Separable Non-negative Matrix Factorization
- Blog: Near-separable Non-negative Matrix Factorization with ℓ1 and Bregman Loss Functions
- Blog: CRAFT: explaining using Concepts from Recursive Activation FacTorization
- Blog: Robustness Analysis of Hottopixx, a Linear Programming Model for Factoring Nonnegative Matrices
- Blog: Recovery Guarantee of Non-negative Matrix Factorization via Alternating Updates
History & citation
Current · Permanent link
- This direction split from Computational Limits of Nonnegative Matrix Factorization (67% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_computational_complexity_of_nmf_e157ebe3,
title = {computational complexity of NMF},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-complexity-of-nmf/rdr_e157ebe3b28a415487d50425f804e1cd},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_computational_complexity_of_nmf_e157ebe3_v1,
title = {computational complexity of NMF},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-complexity-of-nmf/rdr_e157ebe3b28a415487d50425f804e1cd/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}