Global Matrix Decomposition Algorithm
Jump to navigation
Jump to search
A Global Matrix Decomposition Algorithm is a Matrix Decomposition Algorithm that is a Global Data Algorithm.
- AKA: Global Matrix Factorization.
- Example(s):
- Counter-Example(s):
- See: Exact Matrix Factorization.
References
2014
- (Pennington et al., 2014) ⇒ Jeffrey Pennington, Richard Socher, and Christopher D. Manning. (2014). “GloVe: Global Vectors for Word Representation.” In: Proceedings of EMNLP 2014.
- QUOTE: … The result is a new global log-bilinear regression model that combines the advantages of the two major model families in the literature: global matrix factorization and local context window methods. …
2011
- (Lin & Pomerleano, 2011) ⇒ Kevin H. Lin, and Daniel Pomerleano. (2011). “Global matrix factorizations." arXiv preprint arXiv:1101.5847.
- ABSTRACT: We study matrix factorization and curved module categories for Landau-Ginzburg models (X,W) with X a smooth variety, extending parts of the work of Dyckerhoff. Following Positselski, we equip these categories with model category structures. Using results of Rouquier and Orlov, we identify compact generators. Via To\"en's derived Morita theory, we identify Hochschild cohomology with derived endomorphisms of the diagonal curved module; we compute the latter and get the expected result. Finally, we show that our categories are smooth, proper when the singular locus of W is proper, and Calabi-Yau when the total space X is Calabi-Yau.