LGMEJan 9

A New Family of Poisson Non-negative Matrix Factorization Methods Using the Shifted Log Link

arXiv:2601.05845v1h-index: 23
Originality Synthesis-oriented
AI Analysis

This work addresses a domain-specific issue for researchers analyzing count data with Poisson NMF, offering an incremental improvement by modifying the link function.

The authors tackled the problem of Poisson non-negative matrix factorization (NMF) for count data by introducing a shifted-log link function to relax the additive combination assumption of existing methods, resulting in improved interpretability in some settings as demonstrated on real datasets.

Poisson non-negative matrix factorization (NMF) is a widely used method to find interpretable "parts-based" decompositions of count data. While many variants of Poisson NMF exist, existing methods assume that the "parts" in the decomposition combine additively. This assumption may be natural in some settings, but not in others. Here we introduce Poisson NMF with the shifted-log link function to relax this assumption. The shifted-log link function has a single tuning parameter, and as this parameter varies the model changes from assuming that parts combine additively (i.e., standard Poisson NMF) to assuming that parts combine more multiplicatively. We provide an algorithm to fit this model by maximum likelihood, and also an approximation that substantially reduces computation time for large, sparse datasets (computations scale with the number of non-zero entries in the data matrix). We illustrate these new methods on a variety of real datasets. Our examples show how the choice of link function in Poisson NMF can substantively impact the results, and how in some settings the use of a shifted-log link function may improve interpretability compared with the standard, additive link.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes