Sum-of-norms regularized Nonnegative Matrix Factorization
Andersen Ang, Waqas Bin Hamed, Hans De Sterck

TL;DR
This paper introduces SON-NMF, a novel method that automatically estimates the nonnegative rank during NMF, effectively handling rank-deficient data and spectral variability, with a new low-cost algorithm for practical application.
Contribution
The paper proposes SON-NMF, a new approach that estimates the nonnegative rank on-the-fly using sum-of-norm regularization, and develops an efficient first-order algorithm for its solution.
Findings
SON-NMF accurately estimates the nonnegative rank without prior knowledge.
It effectively handles rank-deficient data matrices and weak components.
The proposed algorithm has low per-iteration computational cost.
Abstract
When applying nonnegative matrix factorization (NMF), the rank parameter is generally unknown. This rank, called the nonnegative rank, is usually estimated heuristically since computing its exact value is NP-hard. In this work, we propose an approximation method to estimate the rank on-the-fly while solving NMF. We use the sum-of-norm (SON), a group-lasso structure that encourages pairwise similarity, to reduce the rank of a factor matrix when the initial rank is overestimated. On various datasets, SON-NMF can reveal the correct nonnegative rank of the data without prior knowledge or parameter tuning. SON-NMF is a nonconvex, nonsmooth, non-separable, and non-proximable problem, making it nontrivial to solve. First, since rank estimation in NMF is NP-hard, the proposed approach does not benefit from lower computational complexity. Using a graph-theoretic argument, we prove that the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Face and Expression Recognition
