A Bayesian Perspective for Determinant Minimization Based Robust Structured Matrix Factorizatio
Not on the map. Why?
Abstract (arXiv)
We introduce a Bayesian perspective for the structured matrix factorization problem. The proposed framework provides a probabilistic interpretation for existing geometric methods based on determinant minimization. We model input data vectors as linear transformations of latent vectors drawn from a distribution uniform over a particular domain reflecting structural assumptions, such as the probability simplex in Nonnegative Matrix Factorization and polytopes in Polytopic Matrix Factorization. We represent the rows of the linear transformation matrix as vectors generated independently from a normal distribution whose covariance matrix is inverse Wishart distributed. We show that the corresponding maximum a posteriori estimation problem boils down to the robust determinant minimization approach for structured matrix factorization, providing insights about parameter selections and potential algorithmic extensions.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 20 references that are in the map. First posted on arXiv 16 Feb 2023.
Builds on
5 of 20 references.
References · 5
- 2018Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and Applicationscited by 55
- 2017On Identifiability of Nonnegative Matrix Factorizationcited by 34
- 2016Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clusteringcited by 28
- 2022Polytopic Matrix Factorization: Determinant Maximization Based Criterion and Identifiabilitycited by 14
- 2021Probabilistic Simplex Component Analysiscited by 8
Built on by
Not cited yet.