269 citations · 3k across the 82 of their papers we have counts for
6 papers · 1 filter
Identifiability of Complete Dictionary Learning
Jérémy E. Cohen, Nicolas Gillis
Sparse component analysis (SCA), also known as complete dictionary learning, is the following problem: Given an input matrix and an integer , find a dictionary with …
A note on approximating the nearest stable discrete-time descriptor system with fixed rank
Nicolas Gillis, Michael Karow, Punit Sharma
Consider a discrete-time linear time-invariant descriptor system for . In this paper, we tackle for the first time the problem of stabilizing s…
Improved SVD-based Initialization for Nonnegative Matrix Factorization using Low-Rank Correction
Atif Muhammad Syed, Sameer Qazi, Nicolas Gillis
Due to the iterative nature of most nonnegative matrix factorization (\textsc{NMF}) algorithms, initialization is a key aspect as it significantly influences both the convergence a…
Accelerating Nonnegative Matrix Factorization Algorithms using Extrapolation
Andersen Man Shun Ang, Nicolas Gillis
In this paper, we propose a general framework to accelerate significantly the algorithms for nonnegative matrix factorization (NMF). This framework is inspired from the extrapolati…
Scalable and Robust Sparse Subspace Clustering Using Randomized Clustering and Multilayer Graphs
Maryam Abdolali, Nicolas Gillis, Mohammad Rahmati
Sparse subspace clustering (SSC) is one of the current state-of-the-art methods for partitioning data points into the union of subspaces, with strong theoretical guarantees. Howeve…
Approximating the nearest stable discrete-time system
Nicolas Gillis, Michael Karow, Punit Sharma
In this paper, we consider the problem of stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterizati…