Structured Support Exploration For Multilayer Sparse Matrix Factorization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

Structured Support Exploration For Multilayer Sparse Matrix Factorization


Matrix factorization with sparsity constraints plays an important role in many machine learning and signal processing problems such as dictionary learning, data visualization, dimension reduction. Among the most popular tools for sparse matrix factorization are proximal algorithms, a family of algorithms based on proximal operators. In this paper, we address two problems with the application of proximal algorithms to sparse matrix factorization. On the one hand, we analyze a weakness of proximal algorithms in sparse matrix factorization: the premature convergence of the support. A remedy is also proposed to address this problem. On the other hand, we describe a new tractable proximal operator called Generalized Hungarian Method, associated to so-called k-regular matrices, which are useful for the factorization of a class of matrices associated to fast linear transforms. We further illustrate the effectiveness of our proposals by numerical experiments on the Hadamard Transform and magnetoencephalography matrix factorization.
Fichier principal
Vignette du fichier
Paper-submitted.pdf (517.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03132013 , version 1 (04-02-2021)





Quoc-Tung Le, Rémi Gribonval. Structured Support Exploration For Multilayer Sparse Matrix Factorization. ICASSP 2021 - IEEE International Conference on Acoustics, Speech and Signal Processing, Jun 2021, Toronto, Ontario, Canada. pp.1-5, ⟨10.1109/ICASSP39728.2021.9414238⟩. ⟨hal-03132013⟩
329 View
405 Download



Gmail Facebook X LinkedIn More