arXiv:2603.29715v2 Announce Type: replace
Abstract: Nonnegative matrix factorization (NMF) approximates a nonnegative matrix, X, by the product of two nonnegative factors, WH, where W has r columns a...
By Giovanni Seraghiti, K\'evin Dubrulle, Arnaud Vandaele, Nicolas Gillis
arXiv:2511. 07109v2 Announce Type: replace-cross Abstract: Nonnegative matrix factorization (NMF) is a linear dimensionality reduction technique for nonnegative data, with applications such as hyperspectral unmixing and topic modeling.
By Junjun Pan, Valentin Leplat, Michael Ng, Nicolas Gillis
arXiv:2512. 17473v3 Announce Type: replace-cross Abstract: We present an algorithm based on the alternating direction method of multipliers (ADMM) for solving nonlinear matrix decompositions (NMD).
By Atharva Awari, Nicolas Gillis, Arnaud Vandaele
arXiv:1312. 0925v4 Announce Type: replace Abstract: Alternating Minimization is a widely used and empirically successful heuristic for matrix completion and related low-rank optimization problems.
By Moritz Hardt
arXiv:2609.14307v1 Announce Type: new
Abstract: Low-rank tensor factorization provides a flexible framework for completing multidimensional data from incomplete and corrupted observations. However, u...
By Binghao Wang, Feng Zhang, Wendong Wang, Jianjun Wang
The paper introduces D‑SLR, a closed‑form decomposition that combines a low‑rank approximation with a disjoint row‑sparse component, offering a drop‑in replacement for truncated SVD. Unlike previous joint methods, D‑SLR restricts each row to either be stored verbatim or approximated by the low‑rank fit, achieving the joint optimum without extra parameters and without iterative solvers or regularization tuning. The authors provide an assumption‑free, a‑posteriori error bound for every shape, and demonstrate performance gains on synthetic data, LLM embedding tables, network traffic, and hyperspectral images.
By Vincent Szolnoky
arXiv:2608.21607v1 Announce Type: cross
Abstract: We investigate when a sparse nonnegative matrix can be recovered from a real-valued matrix of much lower rank by zeroing out its negative elements. T...
By Lawrence K. Saul, Ningyuan Huang, Dennis Bollweg, Jeff Soules, Diana C. Halikias
arXiv:2607. 13919v1 Announce Type: new Abstract: Nonnegative Matrix Factorization (NMF) is a fundamental tool in unsupervised learning, which approximates a nonnegative matrix by the product of two low-rank nonnegative factors.
By Damien Lesens, J\'er\'emy E. Cohen, Bora U\c{c}ar
arXiv:2606. 02887v1 Announce Type: new Abstract: Symmetric nonnegative matrix factorization (Symmetric NMF) approximates a matrix as $WW^T$ with nonnegative rectangular factor $W$.
By Ryan Swart, Johannes Brust
arXiv:2606. 08291v1 Announce Type: new Abstract: We study the symmetric multi-type orthogonal non-negative matrix tri-factorization problem, where several symmetric non-negative matrices are simultaneously approximated by factors of the form $GS_{i}G^{\top}$, with a shared non-negative and orthogonal factor $G$.
By Rok Hribar, Gregor Papa, Janez Povh, Andrej Kastrin
Nonnegative matrix factorization (NMF) decomposes a nonnegative matrix into the product of two nonnegative matrices. This property makes NMF well suited for unmixing grain-size distribution data, whic...
The paper introduces MultiHU‑TD, an interpretable framework for multifeature hyperspectral unmixing that employs tensor decomposition and incorporates the abundance sum‑to‑one constraint via an ADMM algorithm. It extends previous models by adding mathematical morphology and neighborhood patch analysis, and provides detailed mathematical, physical, and graphical interpretations linked to the extended linear mixing model. Experiments on real hyperspectral images demonstrate the model’s interpretability and effectiveness, with code released on GitHub.
By Mohamad Jouni, Mauro Dalla Mura, Lucas Drumetz, Pierre Comon