Fast maximum margin matrix factorization for collaborative prediction

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.

• Type: Conference
• Year: 2005
• Where: ICML
• Authors: Jason D. M. Rennie, Nathan Srebro
• Keywords: Current Sdp Solvers, ICML 2005, Machine Learning, Margin Matrix Factorization, Standard Sdp Solvers