Doctoral thesis (Dissertations and theses)
Multilayer and deep matrix factorizations
De handschutter, Pierre
2023
 

Files


Full Text
PDH_PHD_version_à_imprimer.pdf
Author postprint (11.26 MB) Creative Commons License - Public Domain Dedication
Download

All documents in ORBi UMONS are protected by a user license.

Send to



Details



Abstract :
[en] Matrix factorizations (MF) are standard techniques in linear algebra that approximate a data matrix as the product of two smaller matrices whose inner dimension is called the rank of the factorization. A general assumption in MFs is the nonnegativity of the input matrix which led to the development of nonnegative matrix factorization (NMF) models, where the factors are constrained to be nonnegative as well, motivated by several real-world applications. NMF allows one to express the columns of the input matrix, which generally represent data points, as linear combinations of a small number of latent features. In the first part of this thesis, we introduce near-convex archetypal analysis (NCAA), a flexible extension of archetypal analysis, a well-known NMF variant, which has an interesting geometric interpretation and performs competitively with minimum-volume (minVol) NMF. In the second part of this thesis, we study deep MF, that is, the extension of MF to several layers, inspired by the recent advances in deep learning. We conduct a thorough literature review of multilayer and deep MF, focusing on the models, the choice of the parameters, the applications, and the theoretical aspects. We also illustrate the abilities of deep MF to extract hierarchical features within complex data sets on three showcase examples, namely the extraction of facial features, hyperspectral unmixing (HU) and recommender systems. We then introduce two new loss functions for deep MF together with a general optimization framework. We show their efficiency to tackle sparse and minVol deep MF on both synthetic and real-world data. These loss functions alleviate the drawbacks of the current approaches both in a theoretical and experimental point of view. We also design a new greedy initialization algorithm for deep MF and extend symmetric NMF to the deep case. We apply this latter successfully to the extraction of overlapping communities of symptoms in psychiatric networks, with promising clinical interpretation. Finally, we sketch perspectives of future works, including the study of the identifiability of deep MF, the investigation of the connexions between deep MF and deep neural networks, and the exploration of new deep MF models.
Disciplines :
Mathematics
Computer science
Author, co-author :
De handschutter, Pierre ;  Université de Mons - UMONS > Recherche > Service ERC Unit - Matrix Theory and Optimization
Language :
English
Title :
Multilayer and deep matrix factorizations
Defense date :
30 August 2023
Institution :
UMONS - Université de Mons [FPMS], Belgium
Degree :
Doctorat en sciences de l'ingénieur et technologie
Promotor :
Gillis, Nicolas  ;  Université de Mons - UMONS > Faculté Polytechnique > Service de Mathématique et Recherche opérationnelle
Research unit :
F151 - Mathématique et Recherche opérationnelle
Research institute :
R300 - Institut de Recherche en Technologies de l'Information et Sciences de l'Informatique
R450 - Institut NUMEDIART pour les Technologies des Arts Numériques
European Projects :
H2020 - 679515 - COLORAMAP - Constrained Low-Rank Matrix Approximations: Theoretical and Algorithmic Developments for Practitioners
Funders :
European Union
Available on ORBi UMONS :
since 23 October 2024

Statistics


Number of views
26 (2 by UMONS)
Number of downloads
13 (1 by UMONS)

Bibliography


Similar publications



Contact ORBi UMONS