A Non-Negative Matrix Factorization Game
This work addresses a computational bottleneck for researchers and practitioners using NNMF in scientific and engineering applications, though it is incremental as it builds on existing methods.
The authors tackled the problem of improving Non-Negative Matrix Factorization (NNMF) by proposing a game-theoretic formulation, which achieved comparable reconstruction and convergence performance to the traditional Multiplicative Updates algorithm while offering better scaling and parallelization properties.
We present a novel game-theoretic formulation of Non-Negative Matrix Factorization (NNMF), a popular data-analysis method with many scientific and engineering applications. The game-theoretic formulation is shown to have favorable scaling and parallelization properties, while retaining reconstruction and convergence performance comparable to the traditional Multiplicative Updates algorithm.