MM-algorithms for traditional and convex NMF with Tweedie and Negative Binomial cost functions and empirical evaluation

• URL: http://arxiv.org/abs/2603.09601v1
• Date: Tue, 10 Mar 2026 12:46:25 GMT
• Title: MM-algorithms for traditional and convex NMF with Tweedie and Negative Binomial cost functions and empirical evaluation
• Abstract summary: Non-negative matrix factorisation (NMF) is a widely used tool for unsupervised learning and feature extraction.<n>We develop a unified framework for both traditional and convex NMF under a broad class of distributional assumptions.<n>We provide a unified implementation of all considered models, including the first implementations of several convex NMF models.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Non-negative matrix factorisation (NMF) is a widely used tool for unsupervised learning and feature extraction, with applications ranging from genomics to text analysis and signal processing. Standard formulations of NMF are typically derived under Gaussian or Poisson noise assumptions, which may be inadequate for data exhibiting overdispersion or other complex mean-variance relationships. In this paper, we develop a unified framework for both traditional and convex NMF under a broad class of distributional assumptions, including Negative Binomial and Tweedie models, where the connection between the Tweedie and the $β$-divergence is also highlighted. Using a Majorize-Minimisation approach, we derive multiplicative update rules for all considered models, and novel updates for convex NMF with Poisson and Negative Binomial cost functions. We provide a unified implementation of all considered models, including the first implementations of several convex NMF models. Empirical evaluations on mutational and word count data demonstrate that the choice of noise model critically affects model fit and feature recovery, and that convex NMF can provide an efficient and robust alternative to traditional NMF in scenarios where the number of classes is large. The code for our proposed updates is available in the R package nmfgenr and can be found at https://github.com/MartaPelizzola/nmfgenr.

Related papers

• Nonnegative Matrix Factorization through Cone Collapse [0.9453554184019107]
  We propose Cone Collapse, an algorithm that starts from the full nonnegative orthant and iteratively shrinks it toward the minimal cone generated by the data.<n>Across 16 benchmark gene-expression, text, and image datasets, CC-NMF consistently matches or outperforms strong NMF baselines.<n>These results demonstrate that explicitly recovering the data cone can yield both theoretically grounded and empirically strong NMF-based clustering methods.
  arXiv  Detail & Related papers  (2025-11-27T13:22:37Z)
• A Provably-Correct and Robust Convex Model for Smooth Separable NMF [16.819543808413716]
  Nonnegative matrix factorization (NMF) is a linear dimensionality technique for nonnegative data, with applications such as hyperspectral unmixing and topic modeling.<n>In particular, separability assumes that the basis vectors in the NMF are equal to some columns of the input matrix.<n>We propose a convex model for SSNMF and show that it provably recovers the sought-after factors, even in the presence of noise.
  arXiv  Detail & Related papers  (2025-11-10T13:54:27Z)
• Nonnegative matrix factorization and the principle of the common cause [0.0]
  The principle of the common cause (PCC) is a basic methodological approach in probabilistic causality.<n>It seeks an independent mixture model for the joint probability of two dependent random variables.<n>We show that PCC provides a predictability tool that leads to a robust estimation of the effective rank of NMF.<n>We also show how NMF can be employed for data denoising.
  arXiv  Detail & Related papers  (2025-09-03T19:02:39Z)
• NAN: A Training-Free Solution to Coefficient Estimation in Model Merging [61.36020737229637]
  We show that the optimal merging weights should scale with the amount of task-specific information encoded in each model.<n>We propose NAN, a simple yet effective method that estimates model merging coefficients via the inverse of parameter norm.<n>NAN is training-free, plug-and-play, and applicable to a wide range of merging strategies.
  arXiv  Detail & Related papers  (2025-05-22T02:46:08Z)
• Steering Masked Discrete Diffusion Models via Discrete Denoising Posterior Prediction [88.65168366064061]
  We introduce Discrete Denoising Posterior Prediction (DDPP), a novel framework that casts the task of steering pre-trained MDMs as a problem of probabilistic inference. Our framework leads to a family of three novel objectives that are all simulation-free, and thus scalable. We substantiate our designs via wet-lab validation, where we observe transient expression of reward-optimized protein sequences.
  arXiv  Detail & Related papers  (2024-10-10T17:18:30Z)
• Diffusion models for probabilistic programming [56.47577824219207]
  Diffusion Model Variational Inference (DMVI) is a novel method for automated approximate inference in probabilistic programming languages (PPLs) DMVI is easy to implement, allows hassle-free inference in PPLs without the drawbacks of, e.g., variational inference using normalizing flows, and does not make any constraints on the underlying neural network model.
  arXiv  Detail & Related papers  (2023-11-01T12:17:05Z)
• Flexible and Hierarchical Prior for Bayesian Nonnegative Matrix Factorization [4.913248451323163]
  We introduce a probabilistic model for learning nonnegative matrix factorization (NMF) We evaluate the model on several real-world datasets including MovieLens 100K and MovieLens 1M with different sizes and dimensions.
  arXiv  Detail & Related papers  (2022-05-23T03:51:55Z)
• Log-based Sparse Nonnegative Matrix Factorization for Data Representation [55.72494900138061]
  Nonnegative matrix factorization (NMF) has been widely studied in recent years due to its effectiveness in representing nonnegative data with parts-based representations. We propose a new NMF method with log-norm imposed on the factor matrices to enhance the sparseness. A novel column-wisely sparse norm, named $ell_2,log$-(pseudo) norm, is proposed to enhance the robustness of the proposed method.
  arXiv  Detail & Related papers  (2022-04-22T11:38:10Z)
• Entropy Minimizing Matrix Factorization [102.26446204624885]
  Nonnegative Matrix Factorization (NMF) is a widely-used data analysis technique, and has yielded impressive results in many real-world tasks. In this study, an Entropy Minimizing Matrix Factorization framework (EMMF) is developed to tackle the above problem. Considering that the outliers are usually much less than the normal samples, a new entropy loss function is established for matrix factorization.
  arXiv  Detail & Related papers  (2021-03-24T21:08:43Z)
• Cauchy-Schwarz Regularized Autoencoder [68.80569889599434]
  Variational autoencoders (VAE) are a powerful and widely-used class of generative models. We introduce a new constrained objective based on the Cauchy-Schwarz divergence, which can be computed analytically for GMMs. Our objective improves upon variational auto-encoding models in density estimation, unsupervised clustering, semi-supervised learning, and face analysis.
  arXiv  Detail & Related papers  (2021-01-06T17:36:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.