Fast maximum margin matrix factorization for collaborative prediction
Jasson D. M. Rennie, Nathan Srebro · International Conference on Machine Learning · 2005
Maximum Margin Matrix Factorization (MMMF) was recently suggested (Srebro et al., 2005) as a convex, infinite dimensional alternative to low-rank approximations and standard factor models. MMMF can be formulated as a semi-definite programming (SDP) and learned using standard SDP solvers. However, current SDP solvers can only handle MMMF problems on matrices of dimensionality up to a few hundred. Here, we investigate a direct gradient-based optimization method for MMMF and demonstrate it on large collaborative prediction problems. We compare against results obtained by Marlin (2004) and find that MMMF substantially outperforms all nine methods he tested.
Cited by 939 works. doi:10.1145/1102351.1102441
Authors
References
- Learning the parts of objects by non-negative matrix factorization
- Numerical optimization
- Learning Collaborative Information Filters
- Maximum-Margin Matrix Factorization
- Latent semantic models for collaborative filtering
- Weighted low-rank approximations
- An Introduction to the Conjugate Gradient Method Without the Agonizing Pain
- Rank, Trace-Norm and Max-Norm
- The multiple multiplicative factor model for collaborative filtering
- A rank minimization heuristic with application to minimum order system approximation