Factorizing LambdaMART for cold start recommendations

DOI10.1007/S10994-016-5579-3zbMATH Open1386.68135arXiv1511.01282OpenAlexW2229100616MaRDI QIDQ331672FDOQ331672

Authors: Phong Nguyen, Jun Wang, Alexandros Kalousis 

Publication date: 27 October 2016

Published in: Machine Learning (Search for Journal in Brave)

Abstract: Recommendation systems often rely on point-wise loss metrics such as the mean squared error. However, in real recommendation settings only few items are presented to a user. This observation has recently encouraged the use of rank-based metrics. LambdaMART is the state-of-the-art algorithm in learning to rank which relies on such a metric. Despite its success it does not have a principled regularization mechanism relying in empirical approaches to control model complexity leaving it thus prone to overfitting. Motivated by the fact that very often the users' and items' descriptions as well as the preference behavior can be well summarized by a small number of hidden factors, we propose a novel algorithm, LambdaMART Matrix Factorization (LambdaMART-MF), that learns a low rank latent representation of users and items using gradient boosted trees. The algorithm factorizes lambdaMART by defining relevance scores as the inner product of the learned representations of the users and items. The low rank is essentially a model complexity controller; on top of it we propose additional regularizers to constraint the learned latent representations that reflect the user and item manifolds as these are defined by their original feature based descriptors and the preference behavior. Finally we also propose to use a weighted variant of NDCG to reduce the penalty for similar items with large rating discrepancy. We experiment on two very different recommendation datasets, meta-mining and movies-users, and evaluate the performance of LambdaMART-MF, with and without regularization, in the cold start setting as well as in the simpler matrix completion setting. In both cases it outperforms in a significant manner current state of the art algorithms.

Full work available at URL: https://arxiv.org/abs/1511.01282

Recommendations

• Collaborative Preference Learning
• A matrix factorization algorithm with hybrid implicit and explicit attributes for recommender systems
• Improving maximum margin matrix factorization
• Efficient retrieval of matrix factorization-based top-\(k\) recommendations: a survey of recent approaches
• Learning over no-preferred and preferred sequence of items for robust recommendation

zbMATH Keywords

matrix factorizationregularizationlambdamartrecommendation systems

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Cites Work

• Greedy function approximation: A gradient boosting machine.
• Metalearning
• Preference learning: An introduction
• Improving maximum margin matrix factorization
• A new approach to collaborative filtering: operator estimation with spectral regularization

Cited In (1)

• Efficient retrieval of matrix factorization-based top-\(k\) recommendations: a survey of recent approaches

Uses Software

• LambdaMF
• LambdaMART

This page was built for publication: Factorizing LambdaMART for cold start recommendations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q331672)