mlsanityData to 7 Oct 2026

Upper Bound of Bayesian Generalization Error in Non-negative Matrix Factorization

arXiv 1612.04112 ↗First posted 13 Dec 2016math.ST cs.LG stat.MLcited by 10

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Dec 2016.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 1; 2023: 3; 2024: 2; 2025: 1; 2026: 2.

10 papers.