27 citations · 82 across the 18 of their papers we have counts for
6 papers · 2 filters
Matrix-wise -constrained Sparse Nonnegative Least Squares
Nicolas Nadisic, Jeremy E Cohen, Arnaud Vandaele +1
Nonnegative least squares problems with multiple right-hand sides (MNNLS) arise in models that rely on additive linear combinations. In particular, they are at the core of most non…
Deep matrix factorizations
Pierre De Handschutter, Nicolas Gillis, Xavier Siebert
Constrained low-rank matrix approximations have been known for decades as powerful linear dimensionality reduction techniques to be able to extract the information contained in lar…
Multiplicative Updates for NMF with -Divergences under Disjoint Equality Constraints
Valentin Leplat, Nicolas Gillis, Jérôme Idier
Nonnegative matrix factorization (NMF) is the problem of approximating an input nonnegative matrix, , as the product of two smaller nonnegative matrices, and . In this pa…
Simplex-Structured Matrix Factorization: Sparsity-based Identifiability and Provably Correct Algorithms
Maryam Abdolali, Nicolas Gillis
In this paper, we provide novel algorithms with identifiability guarantees for simplex-structured matrix factorization (SSMF), a generalization of nonnegative matrix factorization.…
Sparse Separable Nonnegative Matrix Factorization
Nicolas Nadisic, Arnaud Vandaele, Jeremy E. Cohen +1
We propose a new variant of nonnegative matrix factorization (NMF), combining separability and sparsity assumptions. Separability requires that the columns of the first NMF factor…
On a minimum enclosing ball of a collection of linear subspaces
Timothy Marrinan, P. -A. Absil, Nicolas Gillis
This paper concerns the minimax center of a collection of linear subspaces. When the subspaces are -dimensional subspaces of , this can be cast as finding the cent…