Algorithms for Non-Negative Matrix Factorization on Noisy Data With Negative Values

November 08, 2023 ยท Declared Dead ยท ๐Ÿ› IEEE Transactions on Signal Processing

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Dylan Green, Stephen Bailey arXiv ID 2311.04855 Category astro-ph.IM Cross-listed cs.LG, eess.SP, stat.ME Citations 4 Venue IEEE Transactions on Signal Processing Last Checked 1 month ago
Abstract
Non-negative matrix factorization (NMF) is a dimensionality reduction technique that has shown promise for analyzing noisy data, especially astronomical data. For these datasets, the observed data may contain negative values due to noise even when the true underlying physical signal is strictly positive. Prior NMF work has not treated negative data in a statistically consistent manner, which becomes problematic for low signal-to-noise data with many negative values. In this paper we present two algorithms, Shift-NMF and Nearly-NMF, that can handle both the noisiness of the input data and also any introduced negativity. Both of these algorithms use the negative data space without clipping, and correctly recover non-negative signals without any introduced positive offset that occurs when clipping negative data. We demonstrate this numerically on both simple and more realistic examples, and prove that both algorithms have monotonically decreasing update rules.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” astro-ph.IM

Died the same way โ€” ๐Ÿ‘ป Ghosted