Deep nonnegative matrix factorization with beta divergences

V Leplat, LTK Hien, A Onwunta, N Gillis - Neural Computation, 2024 - direct.mit.edu
Deep nonnegative matrix factorization (deep NMF) has recently emerged as a valuable
technique for extracting multiple layers of features across different scales. However, all …

Bounded simplex-structured matrix factorization

OV Thanh, N Gillis, F Lecron - ICASSP 2022-2022 IEEE …, 2022 - ieeexplore.ieee.org
In this paper, we propose a new low-rank matrix factorization model, dubbed bounded
simplex-structured matrix factorization (BSSMF). Given an input matrix X and a factorization …

Bounded simplex-structured matrix factorization: Algorithms, identifiability and applications

OV Thanh, N Gillis, F Lecron - IEEE Transactions on Signal …, 2023 - ieeexplore.ieee.org
In this article, we propose a new low-rank matrix factorization model dubbed bounded
simplex-structured matrix factorization (BSSMF). Given an input matrix and a factorization …

Towards tuning-free minimum-volume nonnegative matrix factorization

DT Nguyen, EC Chi - Proceedings of the 2024 SIAM International …, 2024 - SIAM
Nonnegative Matrix Factorization (NMF) is a versatile and powerful tool for discovering latent
structures in data matrices, with many variations proposed in the literature. Recently, Leplat …

Block Majorization Minimization with Extrapolation and Application to -NMF

LTK Hien, V Leplat, N Gillis - arXiv preprint arXiv:2401.06646, 2024 - arxiv.org
We propose a Block Majorization Minimization method with Extrapolation (BMMe) for solving
a class of multi-convex optimization problems. The extrapolation parameters of BMMe are …

[PDF][PDF] Deep Nonnegative Matrix Factorization with Beta Divergences

VLLTKH Akwum, ON Gillis - orbi.umons.ac.be
Abstract Deep Nonnegative Matrix Factorization (deep NMF) has recently emerged as a
valuable technique for extracting multiple layers of features across different scales …

[PDF][PDF] Minimum-Volume Nonnegative Matrix Completion

OV Thanh, N Gillis - orbi.umons.ac.be
Low-rank matrix approximation is a standard, yet powerful, embedding technique that can
be used to tackle a broad range of problems, including the recovery of missing data. In this …