Upper Bound of Bayesian Generalization Error in Non-negative Matrix Factorization
arXiv:1612.04112 · doi:10.1016/j.neucom.2017.04.068
Abstract
Non-negative matrix factorization (NMF) is a new knowledge discovery method that is used for text mining, signal processing, bioinformatics, and consumer analysis. However, its basic property as a learning machine is not yet clarified, as it is not a regular statistical model, resulting that theoretical optimization method of NMF has not yet established. In this paper, we study the real log canonical threshold of NMF and give an upper bound of the generalization error in Bayesian learning. The results show that the generalization error of the matrix factorization can be made smaller than regular statistical models if Bayesian learning is applied.
21 pages, 1 table. / Neurocomputing Vol. 266. / ERRATA: Proof of Lemma 3.3 and Discussion is corrected
Cited by in corpus (5)
- Variational Approximation Error in Bayesian Non-negative Matrix Factorization
- Asymptotic Bayesian Generalization Error in Latent Dirichlet Allocation and Stochastic Matrix Factorization
- Estimating Real Log Canonical Thresholds
- The Exact Asymptotic Form of Bayesian Generalization Error in Latent Dirichlet Allocation
- An Asymptotic Equation Linking WAIC and WBIC in Singular Models