Learning with matrix factorizations
Nathan Srebro, Tommi Jaakkola · DSpace@MIT (Massachusetts Institute of Technology) · 2004
Matrices that can be factored into a product of two simpler matricescan serve as a useful and often natural model in the analysis oftabulated or high-dimensional data. Models based on matrixfactorization (Factor Analysis, PCA) have been extensively used instatistical analysis and machine learning for over a century, withmany new formulations and models suggested in recent years (LatentSemantic Indexing, Aspect Models, Probabilistic PCA, Exponential PCA,Non-Negative Matrix Factorization and others). In this thesis weaddress several issues related to learning with matrix factorizations:we study the asymptotic behavior and generalization ability ofexisting methods, suggest new optimization methods, and present anovel maximum-margin high-dimensional matrix factorizationformulation.
Cited by 201 works.
Authors
References
- Indexing by latent semantic analysis
- Latent dirichlet allocation
- Nonlinear Dimensionality Reduction by Locally Linear Embedding
- A Global Geometric Framework for Nonlinear Dimensionality Reduction
- Principal Component Analysis
- Learning the parts of objects by non-negative matrix factorization
- Topics in Matrix Analysis
- Regression Models for Ordinal Data
- Probabilistic Principal Component Analysis
- ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION