TL;DR
This paper introduces an exterior framework for nonnegative matrix factorization (NMF) that improves convergence and solution quality by separating low-rank approximation from nonnegativity constraints, outperforming existing methods.
Contribution
The proposed eNMF method initializes from unconstrained solutions and employs a rotation procedure to efficiently find boundary solutions, offering a new geometric perspective and practical advantages.
Findings
eNMF outperforms 81 state-of-the-art algorithms in reconstruction error and speed.
In 99% of experiments, different algorithms converge to equivalent solutions.
Downstream tasks show significant performance improvements with eNMF.
Abstract
Nonnegative matrix factorization (NMF) seeks a low-rank approximation with nonnegative factors and is commonly solved using interior methods that enforce feasibility throughout optimization. We show that such constraint-driven approaches can impede progress in the nonconvex landscape, leading to slow convergence or convergence to suboptimal stationary points. We propose an exterior framework for NMF (eNMF) that separates low-rank approximation from nonnegativity enforcement. Our method initializes from the optimal unconstrained factorization and introduces a rotation procedure that maps unconstrained factors to an exterior point closest to the nonnegative orthant. This viewpoint yields an algorithmic framework in which simple iterative updates converge to KKT-satisfying stationary points on the boundary of the positive orthant. The exterior formulation also enables a…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
