A consistent and flexible framework for deep matrix factorizations
arXiv:2206.10693 · doi:10.1016/j.patcog.2022.109102
Abstract
Deep matrix factorizations (deep MFs) are recent unsupervised data mining techniques inspired by constrained low-rank approximations. They aim to extract complex hierarchies of features within high-dimensional datasets. Most of the loss functions proposed in the literature to evaluate the quality of deep MF models and the underlying optimization frameworks are not consistent because different losses are used at different layers. In this paper, we introduce two meaningful loss functions for deep MF and present a generic framework to solve the corresponding optimization problems. We illustrate the effectiveness of this approach through the integration of various constraints and regularizations, such as sparsity, nonnegativity and minimum-volume. The models are successfully applied on both synthetic and real data, namely for hyperspectral unmixing and extraction of facial features.
arXiv comment28 pages, few minor modifications. Accepted in Pattern Recognition
References in corpus (7)
- Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and Applications
- Hierarchical Clustering of Hyperspectral Images using Rank-Two Nonnegative Matrix Factorization
- Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering
- Deep matrix factorizations
- Successive Nonnegative Projection Algorithm for Robust Nonnegative Blind Source Separation
- Simplex-Structured Matrix Factorization: Sparsity-based Identifiability and Provably Correct Algorithms
- Explicit Group Sparse Projection with Applications to Deep Learning and NMF