On the Convergence of Multiplicative Update Algorithms for Nonnegative Matrix Factorization
Top Cited Papers
- 5 November 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 18 (6), 1589-1596
- https://doi.org/10.1109/tnn.2007.895831
Abstract
Nonnegative matrix factorization (NMF) is useful to find basis information of nonnegative data. Currently, multiplicative updates are a simple and popular way to find the factorization. However, for the common NMF approach of minimizing the Euclidean distance between approximate and true values, no proof has shown that multiplicative updates converge to a stationary point of the NMF optimization problem. Stationarity is important as it is a necessary condition of a local minimum. This paper discusses the difficulty of proving the convergence. We propose slight modifications of existing updates and prove their convergence. Techniques invented in this paper may be applied to prove the convergence for other bound-constrained optimization problems.Keywords
This publication has 7 references indexed in Scilit:
- Projected Gradient Methods for Nonnegative Matrix FactorizationNeural Computation, 2007
- Algorithms and applications for approximate nonnegative matrix factorizationComputational Statistics & Data Analysis, 2007
- Nonnegative matrix factorization and I-divergence alternating minimizationLinear Algebra and its Applications, 2006
- On reduced rank nonnegative matrix factorization for symmetric nonnegative matricesLinear Algebra and its Applications, 2004
- Non-negative sparse codingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Learning the parts of objects by non-negative matrix factorizationNature, 1999
- Positive matrix factorization: A non‐negative factor model with optimal utilization of error estimates of data valuesEnvironmetrics, 1994