Metraipolis › archive › dc_9bb78ce4a28e
Separable Nonnegative Matrix Factorization Using Powered Ratio-of-Norms Regularization — arXiv:2608.28799
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.28799
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T08:39:38.309Z
- SHA-256 of the archived text
906521bb7973a982c28d8fcdeb40e7ed52dbd7b5a8ef14c517e6725e101a5c86- Stable URL of this page
https://metraipolis.com/documento/dc_9bb78ce4a28e
How to cite
Separable Nonnegative Matrix Factorization Using Powered Ratio-of-Norms Regularization — arXiv:2608.28799 — arXiv (en), https://arxiv.org/abs/2608.28799 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9bb78ce4a28e (Metraipolis archive dc_9bb78ce4a28e, sha256 906521bb7973a982c28d8fcdeb40e7ed52dbd7b5a8ef14c517e6725e101a5c86)
BibTeX
@misc{dc9bb78ce4a28e,
title = {Separable Nonnegative Matrix Factorization Using Powered Ratio-of-Norms Regularization — arXiv:2608.28799},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.28799},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9bb78ce4a28e; sha256 906521bb7973a982c28d8fcdeb40e7ed52dbd7b5a8ef14c517e6725e101a5c86},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.28799. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Separable nonnegative matrix factorization (SNMF) has been widely used for low-rank representation and clustering of nonnegative data, owing to its ability to produce part-based and interpretable decompositions. In particular, SNMF is closely related to graph clustering and community detection. To enhance sparsity and identifiability of the learned factors, we propose an $\ell_1^p/\ell_2$-regularized SNMF model based on a powered ratio-of-norms regularizer. The resulting formulation is nonconvex and nonsmooth, which poses significant challenges for optimization. To address this, we develop efficient algorithms based on the difference-of-convex function algorithm (DCA) and the alternating direction method of multipliers (ADMM). The proposed methods decompose the original problem into tractable subproblems, leveraging closed-form proximal operators associated with the powered norm terms. We establish descent and limiting criticality properties for the DCA scheme and convergence under standard assumptions for the ADMM scheme. Extensive numerical experiments on synthetic datasets and hand gesture classification tasks demonstrate that the proposed approach achieves competitive or improved performance in anchor identification and classification accuracy compared with existing SNMF methods, while maintaining competitive computational efficiency. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-01 in cs.LG). Categorie arXiv: Numerical Analysis (math.NA) ; Machine Learning (cs.LG); Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2608.28799 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T08:13:26.883Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).