A Globally Optimal Analytic Solution for Semi-Nonnegative Matrix Factorization with Nonnegative or Mixed Inputs
Lu Chenggang

TL;DR
This paper introduces a globally optimal, non-iterative solution for semi-NMF that guarantees minimal reconstruction error and outperforms existing methods on synthetic and real datasets.
Contribution
It presents a novel orthogonal decomposition approach that achieves global optimality in semi-NMF, a significant advancement over traditional iterative algorithms.
Findings
Outperforms existing NMF and semi-NMF methods in reconstruction accuracy.
Provides a globally optimal solution with theoretical guarantees.
Reduces to exact NMF in low-rank cases like rank 1 or 2.
Abstract
Semi-Nonnegative Matrix Factorization (semi-NMF) extends classical Nonnegative Matrix Factorization (NMF) by allowing the basis matrix to contain both positive and negative entries, making it suitable for decomposing data with mixed signs. However, most existing semi-NMF algorithms are iterative, non-convex, and prone to local minima. In this paper, we propose a novel method that yields a globally optimal solution to the semi-NMF problem under the Frobenius norm, through an orthogonal decomposition derived from the scatter matrix of the input data. We rigorously prove that our solution attains the global minimum of the reconstruction error. Furthermore, we demonstrate that when the input matrix is nonnegative, our method often achieves lower reconstruction error than standard NMF algorithms, although unfortunately the basis matrix may not satisfy nonnegativity. In particular, in…
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
TopicsTensor decomposition and applications · Face and Expression Recognition · Sparse and Compressive Sensing Techniques
