Polytopic Matrix Factorization: Determinant Maximization Based Criterion and Identifiability

Abstract

We introduce Polytopic Matrix Factorization (PMF) as a novel data decomposition approach. In this new framework, we model input data as unknown linear transformations of some latent vectors drawn from a polytope. In this sense, the article considers a semi-structured data model, in which the input matrix is modeled as the product of a full column rank matrix and a matrix containing samples from a polytope as its column vectors. The choice of polytope reflects the presumed features of the latent components and their mutual relationships. As the factorization criterion, we propose the determinant maximization (Det-Max) for the sample autocorrelation matrix of the latent vectors. We introduce a sufficient condition for identifiability, which requires that the convex hull of the latent vectors contains the maximum volume inscribed ellipsoid of the polytope with a particular tightness constraint. Based on the Det-Max criterion and the proposed identifiability condition, we show that all polytopes that satisfy a particular symmetry restriction qualify for the PMF framework. Having infinitely many polytope choices provides a form of flexibility in characterizing latent vectors. In particular, it is possible to define latent vectors with heterogeneous features, enabling the assignment of attributes such as nonnegativity and sparsity at the subvector level. The article offers examples illustrating the connection between polytope choices and the corresponding feature representations.

arXiv commentJournal

References in corpus (8)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and Applications
• Identifiability of the Simplex Volume Minimization Criterion for Blind Hyperspectral Unmixing: The No Pure-Pixel Case
• Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering
• On Identifiability of Nonnegative Matrix Factorization
• Blind Audio Source Separation with Minimum-Volume Beta-Divergence NMF
• Democratic Representations
• Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization

Cited by in corpus (3)

• Dual Simplex Volume Maximization for Simplex-Structured Matrix Factorization
• Checking the Sufficiently Scattered Condition using a Global Non-Convex Optimization Software
• Exploring Bounded Component Analysis Using an ${\ell }_{\infty }$ Norm Criterion